Cryptographic processing system, cryptographic processing method, cryptograhpic processing program, and key generation device

ABSTRACT

A cryptographic processing system and method to decrease the sizes of public parameters and a master secret key, and shorten the time taken for the generation process of the secret key to be supplied to the user and the encryption process. A generation device generates a basis B and a basis B* that form public parameters and a master secret key using a sparse matrix in which each row and each column have at least one value other than 0. An encryption device generates a vector in the basis B, the vector being embedded with predetermined information, as a cipher vector. A decryption device, by treating a predetermined vector in the basis B* as a key vector, conducts a pairing operation for the cipher vector and the key vector, to decrypt the cipher vector.

TECHNICAL FIELD

The present invention relates to inner-product encryption (IPE).

BACKGROUND ART

Non-Patent Literatures 13, 16, and 17 describe inner-product encryption.

According to the inner-product encryption described in Non-Patent Literatures 13, 16, and 17, a public parameter and a master secret key are given by the basis of a vector space.

CITATION LIST Non-Patent Literature

Non-Patent Literature 1: Abdalla, M., Kiltz, E., Neven, G.: Generalized key delegation for hierarchical identity-based encryption. ESORICS'07, LNCS 4734, pp. 139-154. Springer, (2007)

Non-Patent Literature 2: Attrapadung, N., Libert, B.: Functional encryption for inner product: Achieving constant-size ciphertexts with adaptive security or support for negation. PKC 2010. LNCS, vol. 6056, pp. 384-402. Springer Heidelberg (2010)

Non-Patent Literature 3: Attrapadung, N., Libert, B., De Panafieu, E.: Expressive key-policy attribute-based encryption with constant-size ciphertexts. PKC 2011. LNCS, vol. 6571, pp. 90-108. Springer Heidelberg (2011)

Non-Patent Literature 4: Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In:2007 IEEE Symposium on Security and Privacy, pp. 321-334. IEEE Press (2007)

Non-Patent Literature 5: Boneh, D., Hamburg, M.: Generalized identity based and broadcast encryption scheme. In:Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 455-470. Springer Heidelberg (2008)

Non-Patent Literature 6: Delerablee, C.: Identity-based broadcast encryption with constant size ciphertexts and private keys. In: ASIACRYPT 2007, LNCS, pp. 200-215. Springer-Verlag (2007)

Non-Patent Literature 7: Emura, K., Miyaji, A., Nomura, A., Omote, K., Soshi, M.: A ciphertext-policy attribute-based encryption scheme with constant ciphertext length. Proceedings of ISPEC 2009, LNCS, pp. 13-23. Springer-Verlag (2009)

Non-Patent Literature 8: Gentry, C., Waters, B.: Adaptive security in broadcast encryption systems (with short ciphertexts). In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 171-188. Springer Heidelberg (2009)

Non-Patent Literature 9: Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: ACM Conference on Computer and Communication Security 2006, pp. 89-98, ACM (2006)

Non-Patent Literature 10: Herranz, J., Laguillaumie, F., Rafols, C.: Constant size ciphertexts in thereshold attribute-based encryption, In Nguyen, P. Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 19-34. Springer Heidelberg (2010)

Non-Patent Literature 11: Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N. P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 146-162. Springer Heidelberg (2008)

Non-Patent Literature 12: Lewko, A., Sahai, A., Waters, B.: Revocation systems with very small private keys, In IEEE Symposium on Security and Privacy 2010 (2010)

Non-Patent Literature 13: Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption, EUROCRYPT 2010. LNCS, Springer Heidelberg (2010) Full version is available at http://eprint.iacr.org/2010/110

Non-Patent Literature 14: Lewko, A. B., Waters, B.: New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 455-479. Springer Heidelberg (2010)

Non-Patent Literature 15: Okamoto, T., Takashima, K.: Homomorphic encryption and signatures from vector decomposition. In: Galbraith, S. D., Paterson, K. G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 57-74, Springer Heidelberg (2008)

Non-Patent Literature 16: Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products, In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 214-231. Springer Heidelberg (2009)

Non-Patent Literature 17: Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 191-208. Springer Heidelberg (2010). Full version is available at http://eprint.iacr.org/2010/563

Non-Patent Literature 18: Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457-473. Springer Heidelberg (2005)

Non-Patent Literature 19: Sakai, R., Furukawa, J.: Identity-based broadcast encryption, IACR ePrint Archive: Report 2007/217 http://eprint.iacr.org/2007/217 (2007).

Non-Patent Literature 20: Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619-636. Springer Heidelberg (2009)

SUMMARY OF INVENTION Technical Problem

According to the inner-product encryption described in Non-Patent Literatures 13, 16, and 17, assuming that the length of a vector employed in the inner-product encryption is defined as N, the sizes of public parameters and a master secret key are proportional to N², and the generation process of a secret key to be supplied to the user or an encryption process takes time that is proportional to N².

It is an object of the present invention to decrease the sizes of the public parameters and master secret key, and to shorten the time taken for the generation process of the secret key to be supplied to the user and the encryption process.

Solution to Problem

A cryptographic processing system according to the present invention is configured to utilize a basis B and a basis B* generated by transforming a predetermined basis A using a sparse matrix in which each row and each column have at least one value that is other than constant value 0, to conduct a cryptographic process, the cryptographic processing system comprising:

an encryption device which generates a vector in the basis B, the vector being embedded with predetermined information, as a cipher vector; and

a decryption device which, by treating a predetermined vector in the basis B* as a key vector, conducts a pairing operation for the key vector and the cipher vector which is generated by the encryption device, so as to decrypt the cipher vector, and extracts information on the predetermined information.

Advantageous Effects of Invention

The cryptographic processing system according to the present invention uses a sparse matrix as a matrix that is used for generating bases B and B* which are to form public parameters and a master secret key. This decreases the sizes of the public parameters and master secret key, and shortens the time taken for the generation process of the secret key to be supplied to the user and the encryption process.

BRIEF DESCRIPTION OF DRAWINGS

[FIG. 1] is a configuration diagram of a cryptographic processing system 10 which executes a zero inner-product encryption scheme and a non-zero inner-product encryption scheme.

[FIG. 2] includes an explanatory drawing of a special form of random linear transformation X.

[FIG. 3] is a configuration diagram of a key generation device 100 according to Embodiment 2.

[FIG. 4] is a configuration diagram of an encryption device 200 according to Embodiment 2.

[FIG. 5] is a configuration diagram of a decryption device 300 according to Embodiment 2.

[FIG. 6] is a flowchart showing the process of Setup algorithm according to Embodiment 2.

[FIG. 7] is a flowchart showing the process of KeyGen algorithm according to Embodiment 2.

[FIG. 8] is a flowchart showing the process of Enc algorithm according to Embodiment 2.

[FIG. 9] is a flowchart showing the process of Dec algorithm according to Embodiment 2.

[FIG. 10] is a flowchart showing the process of Setup algorithm according to Embodiment 3.

[FIG. 11] is a flowchart showing the process of KeyGen algorithm according to Embodiment 3.

[FIG. 12] is a flowchart showing the process of Enc algorithm according to Embodiment 3.

[FIG. 13] is a flowchart showing the process of Dec algorithm according to Embodiment 3.

[FIG. 14] is a flowchart showing the process of Setup algorithm according to Embodiment 4.

[FIG. 15] is a flowchart showing the process of KeyGen algorithm according to Embodiment 4.

[FIG. 16] is a flowchart showing the process of Enc algorithm according to Embodiment 4.

[FIG. 17] is a flowchart showing the process of Dec algorithm according to Embodiment 4.

[FIG. 18] is a flowchart showing the process of Setup algorithm according to Embodiment 5.

[FIG. 19] is a flowchart showing the process of KeyGen algorithm according to Embodiment 5.

[FIG. 20] is a flowchart showing the process of Enc algorithm according to Embodiment 5.

[FIG. 21] is a flowchart showing the process of Dec algorithm according to Embodiment 5.

[FIG. 22] shows comparison of non-zero inner-product encryption schemes and zero inner-product encryption schemes explained in Embodiments 2 to 5 with the non-zero inner-product encryption scheme and the zero inner-product encryption scheme described in Non-Patent Literature 2.

[FIG. 23] is a diagram showing an example of the hardware configuration of each of the key generation device 100, the encryption device 200, the decryption device 300, and a key delegation device 400.

DESCRIPTION OF EMBODIMENTS

Embodiments of the present invention will be described hereinafter with reference to the accompanying drawings.

In the following description, a processing device is, for example, a CPU 911 (to be described later). A storage device is, for example, a ROM 913, a RAM 914, or a magnetic disk 920 (each will be described later). A communication device is, for example, a communication board 915 (to be described later). An input device is, for example, a keyboard 902 or the communication board 915 (each will be described later). An output device is, for example, the RAM 914, the magnetic disk 920, the communication board 915, or an LCD 901 (each will be described later). Namely, the processing device, the storage device, the communication device, the input device, and the output device are hardware.

The notations in the following description will be explained.

When A is a random variable or distribution, Formula 101 denotes that y is randomly selected from A according to the distribution of A. Namely, in Formula 101, y is a random number.

$\begin{matrix} {y\overset{R}{\longleftarrow}A} & \left\lbrack {{Formula}\mspace{14mu} 101} \right\rbrack \end{matrix}$

When A is a set, Formula 102 denotes that y is uniformly selected from A. Namely, in Formula 102, y is a uniform random number.

$\begin{matrix} {y\overset{U}{\longleftarrow}A} & \left\lbrack {{Formula}\mspace{14mu} 102} \right\rbrack \end{matrix}$

A vector symbol denotes a vector representation of order q over a finite field F_(q). For example, Formula 103 is established. {right arrow over (x)} denotes (x ₁ , . . . , x _(n))ε

_(q) ^(n)  [Formula 103]

Formula 104 denotes the inner-product, indicated by Formula 106, of two vectors x^(→) and v^(→) indicated by Formula 105. {right arrow over (x)}·{right arrow over (v)}  [Formula 104] {right arrow over (x)}=(x ₁ , . . . , x _(n)) {right arrow over (v)}=(v ₁ , . . . , v _(n))  [Formula 105] Σ_(i=1) ^(n) x _(i) v _(i)  [Formula 106]

Note that X^(T) denotes the transpose of matrix X.

Where b_(i)(i=1, . . . , n) is an element of a vector in a space V, namely where Formula 107 is established, Formula 108 represents a subspace generated by Formula 109. b _(i)ε

(i=1, . . . , L) span

b ₁ , . . . , b _(L)

∪

(resp. span

{right arrow over (x)} ₁ , . . . , {right arrow over (x)} _(L)

)  [Formula 108] b ₁ , . . . , b _(L) (resp. {right arrow over (x)}₁ , . . . , {right arrow over (x)} _(L))  [Formula 109]

For bases B and B* indicated by Formula 110, Formula 111 is established.

:=(b ₁ , . . . , b _(N))

:=(b ₁ *, . . . , b _(N)*)  [Formula 110] (x ₁ , . . . , x _(N)

:=Σ_(i=1) ^(N) x _(i) b _(i), (y ₁ , . . . , y _(N)

:=Σ_(i=1) ^(N) y _(i) b _(i)*,  [Formula 111]

For n of vectors j=1, . . . , n, e^(→) _(j) denotes the canonical basis vector indicated by Formula 112.

e → j : ⁢ ( 0 ⁢ ⁢ … ⁢ ⁢ 0 ︷ j - 1 , 1 , 0 ⁢ ⁢ … ⁢ ⁢ 0 ︷ n - j ) ∈ q n ⁢ ⁢ for ⁢ ⁢ j = 1 , … ⁢ , n [ Formula ⁢ ⁢ 112 ]

Note that GL(n, F_(q)) stands for a general linear group with an order n over the finite field F_(q).

In the following description, when “→” indicating a vector is attached to a subscript or superscript, “→” is attached as a superscript to the subscript or superscript. Likewise, when “*” in a basis B* is attached to a subscript or superscript, “*” is attached as a superscript to the subscript or superscript. Likewise, when t in a space V_(t) is attached to a subscript or superscript, “t” is attached as a subscript to the subscript or superscript.

In the following description, a cryptographic process includes an encryption process, a decryption process, and a key generation process.

Embodiment 1

This embodiment explains a basic concept for implementing an inner-product encryption, and a structure of the inner-product encryption.

First, the concept of the inner-product encryption will be explained.

Second, dual pairing vector spaces (DPVS) which are a space for implementing the inner-product encryption will be explained.

Third, the basic structure of an inner-product encryption scheme to be described in the following embodiments will be explained.

Fourth, the basic structure of a cryptographic processing system 10 which implements the inner-product encryption scheme to be described in the following embodiments will be explained.

Fifth, the basic approach to the inner-product encryption scheme to be described in the following embodiments will be explained.

<1. Concept of Inner-Product Encryption>

First, functional encryption will be explained.

The functional encryption is an advanced concept of encryption. The functional encryption is also a generalization of public-key encryption (PKE) and ID-based encryption (Identity-based encryption; IBE). In functional encryption systems, a receiver can decrypt a ciphertext using a secret key corresponding to a parameter x if the parameter x is suitably related to a parameter y specified for the ciphertext. More specifically, decryption requires R(x, y)=1 for some relation R (relation R that holds for (x, y)).

The inner-product encryption is a kind of functional encryption.

The inner-product encryption includes zero inner-product encryption (ZIPE) and non-zero inner-product encryption (NIPE).

According to the zero inner-product encryption, a cipher encrypted with vector x^(→) can be decrypted by a secret key associated with vector y^(→) such that x^(→)·y^(→)=0. Namely, R^(ZIPE)(x^(→), y^(→))=1 is required if and only if x^(→)·y^(→)=0.

According to the non-zero inner-product encryption, a cipher encrypted with vector x^(→) can be decrypted by a secret key associated with vector y^(→) such that x^(→)·y^(→)≠0. Namely, R^(NIPE)(x^(→), y^(→))=1 is required if and only if x^(→)·y^(→)≠0.

<2. Dual Pairing Vector Spaces>

First, symmetric bilinear pairing groups will be described.

The symmetric bilinear pairing groups (q, G, G_(T), g, e) are a tuple of a prime q, a cyclic additive group G of order q, a cyclic multiplicative group G_(T) of order q, an element g≠0ε G, and a polynomial-time computable nondegenerate bilinear pairing e:G×G→G_(T). The nondegenerate bilinear pairing signifies e(sg, tg)=e(g, g)^(st) where e(g, g)≠1.

In the following description, let G_(bpg) be an algorithm that takes input 1^(λ) and outputs the value of a parameter param_(G):=(q, G, G_(T), g, e) of bilinear pairing groups with a security parameter λ.

Dual pairing vector spaces will now be described.

The dual pairing vector spaces (q, V, G_(T), A, e) can be constituted by a direct product of symmetric bilinear pairing groups (param_(G):=(q, G, G_(T), g, e)). The dual pairing vector spaces (q, V, G_(T), A, e) are a tuple of a prime q, an N-dimensional vector space V over finite field F_(q) indicated in Formula 113, a cyclic group G_(T) of the order q, and a canonical basis A:=(a₁, . . . , a_(N)) of a space V, and have the following operations (1) and (2) where a_(i) is as indicated by Formula 114.

$\begin{matrix} {:=\overset{\overset{N}{︷}}{\times \ldots \times}} & \left\lbrack {{Formula}\mspace{14mu} 113} \right\rbrack \\ {a_{i}:=\left( {\overset{\overset{i - 1}{︷}}{0,\ldots\mspace{14mu},0},g,\overset{\overset{N - i}{︷}}{0,\ldots\mspace{14mu},0}} \right)} & \left\lbrack {{Formula}\mspace{14mu} 114} \right\rbrack \end{matrix}$

Operation (1): Nondegenerate Bilinear Pairing

The pairing on the space V is defined by Formula 115. e(x,y):=Π_(i=1) ^(N) e(g _(i) h _(i))ε

_(T)  [Formula 115] where (g ₁ , . . . , g _(N)):=xε

(h ₁ , . . . , h _(N)):=yε

This is nondegenerate bilinear, i.e., e(sx, ty)=e(s, y)^(st) and if e(x, y)=1 for all yε V, then x=0. For all i and j, e(a_(i), a_(j))=e(g, g)^(δi,j) (δi,j signifying δ_(i,j)) where δ_(i,j)=1 if i=j, and δ_(i,j)=0 if i≠j. Also, e(g, g)≠1ε G_(T).

Operation (2): Standard Maps

Linear transformation φ_(i,j) on the space V indicated by Formula 116 can be easily implemented by Formula 117.

$\begin{matrix} {{{\phi_{i,j}\left( a_{j} \right)} = a_{i}}{{{{if}\mspace{14mu} k} \neq {j\mspace{14mu}{then}\mspace{14mu}{\phi_{i,j}\left( a_{k} \right)}}} = 0}} & \left\lbrack {{Formula}\mspace{14mu} 116} \right\rbrack \\ {{\phi_{i,j}(x)}:=\left( {\overset{\overset{i - 1}{︷}}{0,\ldots\mspace{14mu},0},g_{j},\overset{\overset{N - i}{︷}}{0,\ldots\mspace{14mu},0}} \right)} & \left\lbrack {{Formula}\mspace{14mu} 117} \right\rbrack \end{matrix}$ Note that (g ₁ , . . . g _(N)):=x

Linear transformation φ_(i,j) will be called “standard maps”.

In the following description, let G_(dpvs) be an algorithm that takes as input, 1^(λ)(λ ε natural number) and N ε natural number, and outputs the value of a parameter param_(v):=(q, V, G_(T), A, e) of dual pairing vector spaces which have a security parameter λ and which form an N-dimensional space V.

A case will be described where dual pairing vector spaces are constructed from the symmetric bilinear pairing groups described above. Dual pairing vector spaces can be constructed from asymmetric bilinear pairing groups as well. The following description can be easily applied to a case where dual pairing vector spaces are constructed from asymmetric bilinear pairing groups.

<3. Basic Structure of Inner-Product Encryption Scheme>

First, the zero inner-product encryption scheme will be explained.

A relation R^(ZIPE) in the zero inner-product encryption scheme is defined over a vector x^(→)ε F^(n) _(q)\{0^(→)} and a vector v^(→)ε F^(n) _(q)\{0^(→)}, where R^(ZIPE)(x^(→), v^(→)):=1 if and only if x^(→)·v^(→)=0.

Likewise, a relation R^(NIPE) in the non-zero inner-product encryption scheme is defined over a vector x^(→)ε F^(n) _(q)\{0^(→)} and a vector v^(→)ε F^(n) _(q)\{0^(→)}, where R^(NIPE)(x^(→), v^(→)):=1 if and only if x^(→)·v^(→)≠0.

The zero inner-product encryption scheme and the non-zero inner-product encryption scheme each consist of four algorithms: Setup, KeyGen, Enc, and Dec.

(Setup)

A Setup algorithm is a randomized algorithm that takes as input a security parameter λ and outputs public parameters pk and a master secret key sk.

(KeyGen)

A KeyGen algorithm is a randomized algorithm that takes as input a vector v^(→), public parameters pk, and a master secret key sk, and outputs a decryption key sk_(v→).

(Enc)

An Enc algorithm is a randomized algorithm that takes as input a message m, a vector x^(→), and public parameters pk, and outputs a ciphertext ct_(x→.)

(Dec)

A Dec algorithm is an algorithm that takes as input a ciphertext ct_(x→) that was encrypted under a vector x^(→), a decryption key sk_(v→) for vector v^(→), and public parameters pk, and outputs either a message m or distinguished symbol ⊥. The distinguished symbol ⊥ indicates that decryption could not be achieved.

<4. Basic Structure of Cryptographic Processing System 10>

FIG. 1 is a configuration diagram of a cryptographic processing system 10 which executes the zero inner-product encryption scheme and the non-zero inner-product encryption scheme.

A key generation device 100 executes the Setup algorithm by taking as input a security parameter λ, to generate public parameters pk and a master secret key sk. The key generation device 100 publicizes the generated public parameters pk. The key generation device 100 also executes the KeyGen algorithm by taking as input a vector v^(→), to generate a decryption key sk_(v→), and distributes the decryption key sk_(v→) to a decryption device 300 in secrecy.

An encryption device 200 executes the Enc algorithm by taking as input a message in, a vector x^(→), and the public parameters pk, to generate a ciphertext ct_(x→). The encryption device 200 transmits the generated ciphertext ct_(x→) to the decryption device 300.

The decryption device 300 executes the Dec algorithm by taking as input the public parameters pk, the decryption key sk_(v→), and the ciphertext ct_(x→), and outputs a message m′ (=m) or distinguished symbol ⊥.

<5. Basic Approach to Encryption Scheme>

In a typical application in which dual pairing vector spaces are applied to cryptographic processing, a pair of dual (or orthogonal) bases, B and B*, are generated. The bases B and B* are generated using a fully random linear transformation X (basis transformation matrix) uniformly selected from GL(N, F_(q)). Particularly, the bases B and B* are each generated through conversion of a canonical basis A using linear transformations X and (X⁻¹)^(T) where N is the number of dimensions of span<B> and span <B*>.

The typical application in which the dual pairing vector spaces are applied to cryptographic processing employs part of the basis B (called B^) as a public parameter, and part of the corresponding basis B* (called B^*) as a secret key or trap door.

In the inner-product encryption to be explained in the following embodiments, a special form of random linear transformation X, being X ε GL(N, F_(q)), is employed in place of the fully random linear transformation X described above. This special form of linear transformation X can decrease the sizes of the ciphertext and secret key, and decrease the number of pairing operations which are time-consuming to process.

FIG. 2 includes an explanatory drawing of a special form of linear transformation X.

Fully random linear transformation X is shown in (a) of FIG. 2, and a special form of linear transformation X is shown in (b) of FIG. 2. In (a) and (b) of FIG. 2, square portions indicate components the values of which are random numbers other than 0. In (b) of FIG. 2, blank elements indicate components the values of which are 0. In (b) of FIG. 2, hatched squares indicate components the values of which are the same. Note that N=5.

As shown in (a) of FIG. 2, a conventional linear transformation X has a size of N² (here 5²=25). In contrast, as shown in (b) of FIG. 2, a linear transformation X employed in the inner-product encryption to be explained in the following embodiments (to be referred to as a new linear transformation X hereinafter) has a size of N+1 (here 5+1=6).

As mentioned above, the bases B and B* are generated through conversion of the canonical basis A using the linear transformation X. Accordingly, the sizes of the bases B and B* are proportional to the size of the linear transformation X. As described above, part of the basis B and part of the basis B* form the public parameter and the secret key. Hence, the sizes of the public parameter and secret key are proportional to the linear transformation X. More specifically, with the conventional linear transformation X, the sizes of the public parameter and secret key are proportional to N², whereas with the new linear transformation X, the sizes of the public parameter and secret key are proportional to N+1.

Consequently, with the conventional linear transformation X, the generation process of a user key or the encryption process takes time that is proportional to N², whereas with the new linear transformation X, the generation process of the user key or the encryption process takes time that is proportional to N+1. Namely, with the new linear transformation X, the calculation time is on the order of N.

A specific method of realizing a constant-size ciphertext and efficient decryption will be explained regarding the non-zero inner-product encryption scheme as an example.

Note that in the explanation of a ciphertext size, vector description will not be included as part of the ciphertext. Likewise, note that in the explanation of a decryption key size as well, vector description will not be included as part of the decryption key.

An explanation will be given using a simplified form of the non-zero inner-product scheme to be described in the following embodiments.

A ciphertext in a simplified non-zero inner-product encryption scheme consists of two vector elements (c₀, c₁)ε G⁵×G^(n), and c₃ε G_(T). A secret key consists of two vector elements k*₀ and k*₁ε G⁵×G^(n). Note that (c₀, c₁)ε G⁵×G^(n) signifies that c₀ consists of five elements of G and c₁ consists of n of elements of G. Likewise, k*₀ and k*₁ε G⁵×G^(n) signify that k*₀ consists of five elements of G and k*₁ consists of n of elements of G.

Therefore, to achieve a constant-size ciphertext, c₁ε G^(n) need be compressed to a constant size in n.

The special linear transformation X indicated by Formula 118 is employed.

X := ( μ μ 1 ′ ⋱ ⋮ μ μ n - 1 ′ μ n ′ ) ∈ ⁢ ( n , q ) [ Formula ⁢ ⁢ 118 ]

Note that μ, μ′₁, . . . , μ′_(n) are values uniformly selected from a finite field F_(q), and that a blank in the linear transformation X denotes a constant value 0ε F_(q). The constant value 0 signifies that the value is fixed to 0. Namely, μ, μ′₁, . . . , μ′_(n) are uniform random values that can take 0 as well, whereas a blank in the linear transformation X have a value that is fixed to 0. Also, H(n, F_(q)) signifies a set of n-order matrices having the finite field F_(q) as an element.

The system parameter, or the public basis of DPVS is the basis B indicated by Formula 119.

$\begin{matrix} {:={\begin{pmatrix} b_{1} \\ \vdots \\ \; \\ b_{n} \end{pmatrix}:=\begin{pmatrix} {\mu\; g} & \; & \; & {\mu_{1}^{\prime}g} \\ \; & \ddots & \; & \vdots \\ \; & \; & {\mu\; g} & {\mu_{n - 1}^{\prime}g} \\ \; & \; & \; & {\mu_{n}^{\prime}g} \end{pmatrix}}} & \left\lbrack {{Formula}\mspace{14mu} 119} \right\rbrack \end{matrix}$

Let a ciphertext associated with x^(→):=(x₁, . . . , x_(n)) be a ciphertext c₁ indicated by Formula 120. c ₁:=(ω{right arrow over (x)})

=ω(x ₁b₁+ . . . +x_(n) b _(n))=(x ₁ ωμg, . . . , x _(n−1)ωμg, ω(Σ_(i=1) ^(n)x_(i)μ_(i)′)g)  [Formula 120]

Note that ω is a value uniformly selected from the finite field F_(q).

Then, the ciphertext c₁ can be compressed to the vector x^(→) and two group elements C₁ and C₂ indicated by Formula 121. C ₁ :=ωμg, C ₂:=ω(Σ_(i=1) ^(n) x _(i)μ_(i)′)g  [Formula 121]

This is because the ciphertext c₁ can be obtained by (x₁C₁, . . . , x_(n−1)C₁, C₂). Note that x_(i)C₁=x_(i)ωμg holds for each i of i=1, . . . , n−1.

Hence, a ciphertext (excluding the vector x^(→)) can consist of two group elements, and has a constant size in n.

Let B*:=(b*_(i)) be the dual orthogonal basis of B:=(b_(i)), and the basis B* be the master secret key in the simplified non-zero inner-product encryption scheme. Note that (c₀, k*₀, c₃) is specified such that e(c₀, k*₀)=gT^(ζ)·g_(T) ^(ωδ) and c₃:=g_(T) ^(ζ)mε G_(T). Also, note that a secret key for the vector v^(→) is set as k*₁(δv^(→))_(B*)=δ(v₁b*₁+ . . . +v_(n)b*_(n)).

From the dual orthonormality of the bases B and B*, it then holds that e(c₁, k*₁)=g_(T) ^(ωδ(x→·v→)). Hence, a decryptor can compute g_(T) ^(ωδ) if and only if x^(→)·v^(→)≠0. Namely, the decryptor can obtain a message m by Formula 122. c ₃ ·e(c ₀ ,k ₀*)⁻¹ ·e(c ₁ ,k ₁*)^(({right arrow over (x)}·{right arrow over (v)})−1)  [Formula 122]

The ciphertext c₁ is expressed as (x₁C₁, . . . , x_(n−1)C₁, C₂)ε G^(n), and the secret key k*₁ is parsed as a n-tuple (K₁, . . . , K_(n)). Hence, the value of e(c₁, k*₁) is as indicated by Formula 123.

$\begin{matrix} {{\prod\limits_{i = 1}^{n - 1}\;{{e\left( {{x_{i}C_{1}},K_{i}} \right)} \cdot {e\left( {C_{2},K_{n}} \right)}}} = {{\prod\limits_{i = 1}^{n - 1}\;{{e\left( {C_{1},{x_{i}K_{i}}} \right)} \cdot {e\left( {C_{2},K_{n}} \right)}}} = {{e\left( {C_{1},{\sum\limits_{i = 1}^{n - 1}{x_{i}K_{i}}}} \right)} \cdot {e\left( {C_{2},K_{n}} \right)}}}} & \left\lbrack {{Formula}\mspace{14mu} 123} \right\rbrack \end{matrix}$

That is, n−1 scalar multiplications in G and two pairing operations are enough for computing e(c₁, k*₁). That is, only a small (constant) number of pairing operations are required for decryption. Generally, pairing operations take a long processing time. By decreasing the number of pairing operations, the processing time as the whole process can be shortened.

In the simplified non-zero inner-product encryption scheme, the ciphertext c₁ consists of only a basis vector (real encoding part) where the vector x^(→) is set, and the secret key k*₁ consists of only a basis vector (real encoding part) where the vector v-÷ is set.

In the non-zero inner-product encryption scheme to be described in the following embodiments, in order to improve the security, basis vectors for a real encoding part as well as for a hidden part, a secret-key randomness part, and a ciphertext randomness part are added to the ciphertext c₁ and the secret key k*₁.

Four this purpose, the linear transformation X is extended as indicated by Formula 124.

$\begin{matrix} {X:=\begin{pmatrix} X_{1,1} & \ldots & X_{1,4} \\ \vdots & \; & \vdots \\ X_{4,1} & \ldots & X_{4,4} \end{pmatrix}} & \left\lbrack {{Formula}\mspace{14mu} 124} \right\rbrack \end{matrix}$

Note that each X_(i,j) is of the form of X ε H(n, F_(q)) indicated by Formula 118. The vector space consists of four orthogonal subspaces. Namely, the vector space consists of four orthogonal subspaces for the real encoding part, hidden part, secret-key randomness part, and ciphertext randomness part.

Embodiment 2

In Embodiment 2, a non-zero inner-product encryption scheme having a constant-size ciphertext will be described.

FIG. 3 is a configuration diagram of a key generation device 100 according to Embodiment 2. FIG. 4 is a configuration diagram of an encryption device 200 according to Embodiment 2. FIG. 5 is a configuration diagram of a decryption device 300 according to Embodiment 2.

FIGS. 6 and 7 are flowcharts showing the operation of the key generation device 100 according to Embodiment 2, in which FIG. 6 is a flowchart showing the process of Setup algorithm according to Embodiment 2, and FIG. 7 is a flowchart showing the process of KeyGen algorithm according to Embodiment 2. FIG. 8 is a flowchart showing the operation of the encryption device 200 according to Embodiment 2, that is, a flowchart showing the process of Enc algorithm according to Embodiment 2. FIG. 9 is a flowchart showing the operation of the decryption device 300 according to Embodiment 2, that is, a flowchart showing the process of Dec algorithm according to Embodiment 2.

In the following description, let a vector x^(→)*:=(x₁, . . . , x_(n)) to be inputted hold x_(L)≠0 for each integer L of L=1, . . . , n−1, and let a vector v^(→):=(v₁, . . . , v_(n)) to be inputted hold v_(n)≠0.

The key generation device 100 will be described.

As shown in FIG. 3, the key generation device 100 is provided with a master key generation part 110, a master key storage part 120, an information input part 130, a decryption key generation part 140, and a key distribution part 150. The master key generation part 110 is provided with a space generation part 111, a matrix generation part 112, a basis generation part 113, and a key generation part 114. The decryption key generation part 140 is provided with a random number generation part 141 and a key element generation part 142.

The process of the Setup algorithm will be described with reference to FIG. 6.

(S101: Space Generation Step)

The space generation part 111 takes security parameter 1^(λ) as an input and executes G_(bpg) with a processing device, to generate parameter param_(G):=(q, G, G_(T), g, e) of symmetric bilinear pairing groups.

Furthermore, the space generation part 111 sets N₀:=5 and N₁:=4n. Then, for each t of t=0, 1, the space generation part 111 takes as input the security parameter 1^(λ), N_(t), and the parameter param_(G) of the symmetric bilinear pairing groups and executes G_(dpvs) with the processing device, to generate a parameter param_(vt):=(q, V_(t), G_(r), A_(t), e) of the dual pairing vector spaces.

(S102: Linear Transformation Generation Step)

With the processing device, the matrix generation part 112 generates linear transformation X₀, as indicated by Formula 125.

X 0 := ( χ 0 , i , j ) i , j = 1 , … ⁢ , 5 ⁢ ⟵ U ⁢ GL ⁡ ( N 0 , q ) [ Formula ⁢ ⁢ 125 ]

Note that (χ_(0,i,j))=_(i,j=1, . . . , 5) in Formula 125 signifies a matrix concerning subscripts and j of a matrix χ_(0,i,j).

With the processing device, the matrix generation part 112 generates linear transformation X₁, as indicated by Formula 126.

X 1 ⁢ ⟵ U ⁢ ⁢ ( N 1 , q ) [ Formula ⁢ ⁢ 126 ]

Note that L(N, F_(q)) in Formula 126 is as indicated by Formula 127.

⁢( N , q ) := { X := ( X 1 , 1 … X 1 , 4 ⋮ ⋮ X 4 , 1 … X 4 , 4 ) ❘ X i , j := ( μ i , j μ i , j , 1 ′ ⋱ ⋮ μ i , j μ i , j , n - 1 ′ μ i , j , n ′ ) ⁢ ∈ ⁢ ( n , q ) ⁢ for ⁢ ⁢ i , j = 1 , … ⁢ , 4 } ⁢ ⁢ ⋂ GL ⁡ ( N , q ) , ⁢ ⁢ ( n , q ) := { ( u u 1 ′ ⋱ ⋮ u u n - 1 ′ u n ′ ) ❘ u , u L ′ ∈ q ⁢ for L = 1 , ⁢ … , n , a ⁢ ⁢ blank ⁢ ⁢ element ⁢ ⁢ in ⁢ ⁢ the ⁢ ⁢ matrix ⁢ denotes ⁢ ⁢ 0 ∈ q ⁢ } [ Formula ⁢ ⁢ 127 ]

Note that {μ_(i,j), μ′_(i,j,L)}_(i,j=1, . . . , 4;L=1, . . . , n) in the following description denotes an element other than constant value 0 in the linear transformation X₁.

(S 103: Basis B Generation Step)

With the processing device, the basis generation part 113 generates a basis B₀ and variables B_(i,j) and B′_(i,j,L), as indicated by Formula 128. b _(0,i):=(χ_(0,i,1), . . . , χ_(0,i,5))

=Σ_(j=1) ⁵χ_(0,i,k)α_(j) for i=1, . . . , 5,

₀:=(b _(0,1) , . . . , b _(0,5)), B _(i,j):=μ_(i,j) g, B _(i,j,L)′:=μ_(i,j,L) ′g for i,j=1, . . . , 4;L=1, . . . , n  [Formula 128]

With the processing device, the basis generation part 113 also generates a basis B*₀ and a basis B*₁, as indicated by Formula 129. for t=0,1 (θ_(t,i,j))_(i,j=1, . . . , N) _(t) :=ψ·(X _(t) ^(T))⁻¹, b _(t,i)*:=(θ_(t,i,1), . . . , θ_(t,i,N) _(t)

=Σ_(j=1) ^(N) ^(t) θ_(t,i,j)α_(j) for i=1, . . . , N _(t),

_(t)*:=(b _(t,1) *, . . . , b _(t,N) _(t) *)  [Formula 129]

(S104: Basis BA Generation Step)

With the processing device, the key generation part 114 generates bases B^₀, B^*₀, and B^*₁, as indicated by Formula 130.

₀:=(b _(0,1) ,b _(0,3) ,b _(0,5)),

₀*:=(b _(0,1) *,b _(0,3) *,b _(0,4)*),

₁*:=(b _(1,1) *, . . . , b _(1,n) *,b _(1,2n+1) *, . . . b _(1,3n)*)  [Formula 130]

(S105: Master Key Generation Step)

With the processing device, the key generation part 114 sets public parameters pk:=(1^(λ), param_(n), B^₀, {B_(i,j), B′_(i,j,L)}_(i=1,4:j=1, . . . , 4;L=1, . . . , n)), and master secret key sk:={B^*_(t)}_(t=0,1). Then, the key generation part 114 stores the public parameters pk and the master secret key sk in the master key storage part 120.

Note param_(n):=({param_(Vt)}_(t=0,1), g_(T)).

More specifically, from S101 through S105, the key generation device 100 executes the Setup algorithm indicated by Formula 132 using algorithm G⁽¹⁾ _(0b) indicated by Formula 131, to generate the public parameters pk and the master secret key sk.

ob ( 1 ) ⁢ ( 1 λ , n ) ⁢ : ⁢ ⁢ param := ( q , , T , g , e ) ⁢ ⟵ R ⁢ bpg ⁢ ( 1 λ ) , ⁢ ⁢ N 0 := 5 , N 1 := 4 ⁢ n , ⁢ param t := ( q , t , T , t , e ) := dpvs ⁢( 1 λ , N t , param ) ⁢ ⁢ ⁢ for ⁢ ⁢ ⁢ t = 0 , 1 , ψ ⁢ ⟵ U ⁢ q x , g T := e ⁡ ( g , g ) ψ , ⁢ ⁢ param n := ( { param t } t = 0 , 1 , g T ) , X 0 := ( χ 0 , i , j ) i , j = 1 , … ⁢ , 5 ⁢ ⟵ U ⁢ GL ⁡ ( N 0 , q ) , X 1 ⁢ ⟵ U ⁢ ⁢ ( N 1 , q ) , ⁢ ⁢ hereafter , { μ i , j , μ i , j , L ′ } i , j = 1 , … ⁢ , 4 ; L = 1 , … ⁢ , n ⁢ ⁢ ⁢ ⁢ denotes ⁢ ⁢ non ⁢ - ⁢ ⁢ zero ⁢ ⁢ entries ⁢ ⁢ of ⁢ ⁢ X 1 , ⁢ ⁢ b 0 , i := ( χ 0 , i , 1 , … ⁢ , ⁢ χ 0 , i , 5 ) = ∑ j = 1 5 ⁢ χ 0 , i , j ⁢ a j [ Formula ⁢ ⁢ 131 ] ⁢ for ⁢ ⁢ ⁢ i = 1 , … ⁢ , 5 , 0 := ( b 0 , 1 , … ⁢ , b 0 , 5 ) , ⁢ ⁢ B i , j := μ i , j ⁢ g , B i , j , L ′ := μ i , j , L ′ ⁢ g ⁢ ⁢ ⁢ for ⁢ ⁢ ⁢ i , j = 1 , … ⁢ , 4 ; L = 1 , … ⁢ , n , ⁢ for ⁢ ⁢ ⁢ t = 0 , 1 ⁢ ( ϑ t , i , j ) i , j = 1 , … ⁢ , N t := ψ · ( X t T ) - 1 , ⁢ ⁢ b t , i * := ( ϑ t , i , 1 , … ⁢ , ⁢ ϑ t , i , N t ) = ∑ j = 1 N t ⁢ ϑ t , i , j ⁢ a j ⁢ for ⁢ ⁢ ⁢ i = 1 , … ⁢ , N t , t * := ( b t , 1 * , … ⁢ , b t , N t * ) , ⁢ ⁢ return ⁢ ⁢ ( param n , 0 , 0 * ⁢ { B i , j , B i , j , L ′ } i , j = 1 , … ⁢ , 4 ; L = 1 , … ⁢ , n , 1 * ) . Setup ⁡ ( 1 λ , n ) ⁢ : ⁢ ⁢ ( param m , 0 , 0 * ⁢ { B i , j , B i , j , L ′ } i , j = 1 , … ⁢ , 4 ; L = 1 , … ⁢ , n , 1 * ) ⁢ ⁢ ⟵ R ⁢ ob ( 1 ) ⁢ ( 1 λ , n ) , ⁢ ⁢ ^ 0 := ( b 0 , 1 , b 0 , 3 , b 0 , 5 ) , ^ 0 * := ( b 0 , 1 * , b 0 , 3 * , b 0 , 4 * ) , ⁢ ⁢ ^ 1 * := ( b 1 , 1 , … ⁢ , * ⁢ b 1 , n * , b 1 , 2 ⁢ n + 1 , … ⁢ , * ⁢ b 1 , 3 ⁢ n * ) , ⁢ ⁢ return ⁢ ⁢ pk := ( 1 λ , param n , ^ 0 , { B i , j , B i , j , L ′ } i = 1 , 4 ; j = 1 , … ⁢ , 4 ; L = 1 , … ⁢ , n ) , sk := { ^ t * } t = 0 , 1 . [ Formula ⁢ ⁢ 132 ]

Note that the public parameters are publicized via, e.g., a network, so the encryption device 200 and decryption device 300 can acquire them.

In S103, instead of basis B₁, variable B_(i,j) was generated. If basis B₁ is to be generated, it will be as indicated by Formula 133.

$\begin{matrix} {{\begin{pmatrix} b_{1,{{{({i - 1})}n} + 1}} \\ \vdots \\ b_{1,{i\; n}} \end{pmatrix}:=\begin{pmatrix} B_{i,1} & \; & \; & B_{i,1,1}^{\prime} & \; & B_{i,4} & \; & \; & B_{i,4,1}^{\prime} \\ \; & \ddots & \; & \vdots & \ldots & \; & \ddots & \; & \vdots \\ \; & \; & B_{i,1} & B_{i,1,{n - 1}}^{\prime} & \; & \; & \; & B_{i,4} & B_{i,4,{n - 1}}^{\prime} \\ \; & \; & \; & B_{i,1,n}^{\prime} & \; & \; & \; & \; & B_{i,4,n}^{\prime} \end{pmatrix}}\mspace{79mu}{{{{for}\mspace{14mu} i} = 1},\ldots\mspace{14mu},4,\mspace{79mu}{{??}_{1}:=\left( {b_{1,1},\ldots\mspace{14mu},b_{1,{4\; n}}} \right)}}} & \left\lbrack {{Formula}\mspace{14mu} 133} \right\rbrack \end{matrix}$

A blank element in the matrix of Formula 133 denotes a component value 0ε G. The basis B₁ is an orthogonal basis of the basis B*₁. That is, e(b_(1,i), b*_(1,j))=g_(T), and e(b_(1,i), b*_(i,j))=1 for integers i, j satisfying 1≦i≠j≦4n.

The process of the KeyGen algorithm will be described with reference to FIG. 7.

(S111: Information Input Step)

With the input device, the information nut part 130 takes as input the vector v^(→).

(S112: Random Number Generation Step)

With the processing device, the random number generation part 141 generates random numbers, as indicated by Formula 134.

$\begin{matrix} {\delta,\varphi_{0},\varphi_{1},{\overset{\bigcup}{\longleftarrow}{??}_{q}}} & \left\lbrack {{Formula}\mspace{14mu} 134} \right\rbrack \end{matrix}$

(S113: Element k*₀ Generation Step)

With the processing device, the key element generation part 142 generates element k*₀, which is an element of a decryption key sk_(v→), as indicated by Formula 135. k ₀*:=(δ,0,1,φ₀,0

  [Formula 135]

As mentioned above, for the bases B and B* indicated by Formula 110, Formula 111 is established. Hence, Formula 135 means that: δ is set as the coefficient for basis vector b*_(0,1) of the basis B*₀; 0 is set as the coefficient for basis vector b*_(0,2); 1 is set as the coefficient for basis vector b*_(0,3); φ₀ is set as the coefficient for basis vector b_(0,4)*; and 0 is set as the coefficient for basis vector b*_(0,5).

(S114: Element k*_(i) Generation Step)

With the processing device, the key element generation part 142 generates element k*₁, which is an element of the decryption key sk_(v→), as indicated by Formula 136.

$\begin{matrix} {k_{1}^{*}:=\begin{pmatrix} {\overset{\overset{n}{︷}}{\delta\;\overset{->}{v}},} & {\overset{\overset{n}{︷}}{0^{n}},} & {\overset{\overset{n}{︷}}{\varphi_{1}\overset{->}{v}},} & \overset{\overset{n}{︷}}{0^{n}} \end{pmatrix}_{{??}_{1}^{*}}} & \left\lbrack {{Formula}\mspace{14mu} 136} \right\rbrack \end{matrix}$

As with Formula 135, Formula 136 means that: δv₁, . . . , δv_(n) are each set as the coefficient for basis vectors b*_(1,1), b*_(1,n) of the basis B*₁; 0 is set as the coefficient for basis vectors b*_(1,n+1), . . . , b*_(1,2n); φ₁v₁, . . . , φ₁v_(n) are each set as the coefficient for basis vectors b*_(1,2n+1), . . . , and b*_(1,3n); and 0 is set as the coefficient for basis vectors b*_(1,3n+1), . . . , b*_(1,4n).

(S115: Key Distribution Step)

For example, with the communication device, the key distribution part 150 distributes the decryption key sk_(v→), constituted by as elements: the vector v^(→) inputted in S111; the element k*₀ generated in S113; and the element k*₁ generated in S114, to the decryption device 300 in secrecy via the network. As a matter of course, the decryption key sk_(v→) might as well be distributed to the decryption device 300 by another method.

More specifically, from S111 through S114, the key generation device 100 executes the KeyGen algorithm indicated by Formula 137, to generate the decryption key sk_(v→). Then, in S 115, the key generation device 100 distributes the generated decryption key sk_(v→) to the decryption device 300.

$\begin{matrix} {{{{KeyGen}\left( {{p\; k},{sk},\overset{->}{v}} \right)}\text{:}}\delta,\varphi_{0},\varphi_{1},{\overset{\bigcup}{\longleftarrow}{??}_{q}},{k_{0}^{*}:=\left( {\delta,0,1,\varphi_{0},0} \right)_{{??}_{0}^{*}}},{k_{1}^{*}:=\begin{pmatrix} {\overset{\overset{n}{︷}}{\delta\;\overset{->}{v}},} & {\overset{\overset{n}{︷}}{0^{n}},} & {\overset{\overset{n}{︷}}{\varphi_{1}\overset{->}{v}},} & \overset{\overset{n}{︷}}{0^{n}} \end{pmatrix}_{{??}_{1}^{*}}},{{{return}\mspace{14mu}{sk}_{\overset{->}{v}}}:={\left( {\overset{->}{v},k_{0}^{*},k_{1}^{*}} \right).}}} & \left\lbrack {{Formula}\mspace{14mu} 137} \right\rbrack \end{matrix}$

The encryption device 200 will be described.

As shown in FIG. 4, the encryption device 200 is provided with a public parameter acquisition part 210, an information input part 220, a ciphertext generation part 230, and a data transmission part 240. The ciphertext generation part 230 is provided with a random number generation part 231 and a cipher element generation part 232.

The process of the Enc algorithm will be described with reference to FIG. 8.

(S121: Public Parameter Acquisition Step)

For example, with the communication device, the public parameter acquisition part 210 acquires the public parameters pk generated by the key generation device 100, via the network.

(S122: Information Input Step)

With the input device, the information input part 220 takes as input the vector x^(→).

Also, with the input device, the information input part 222 takes as input a message m.

(S 123: Random Number Generation Step)

With the processing device, the random number generation part 231 generates random numbers, as indicated by Formula 138.

$\begin{matrix} {\omega,\eta_{0},\eta_{1},{\zeta\overset{\bigcup}{\longleftarrow}{??}_{q}}} & \left\lbrack {{Formula}\mspace{14mu} 138} \right\rbrack \end{matrix}$

(S124: Element c₀ Generation Step)

With the processing device, the cipher element generation part 232 generates element c₀, which is an element of a ciphertext ct_(x→), as indicated by Formula 139. c ₀:=(−ω,0,ζ,0,η₀

  [Formula 139]

As with Formula 135, Formula 139 means that: —ω is set as the coefficient for basis vector b_(0,1) of the basis B₀;0 is set as the coefficient for basis vector b_(0,2); ζ is set as the coefficient for basis vector b_(0,3); 0 is set as the coefficient for basis vector b_(0,4); and η₀ is set as the coefficient for basis vector b_(0,5).

(S125: Element C Generation Step)

With the processing device, the cipher element generation part 232 generates an element C_(1,j) and an element C_(2j), which are elements of the ciphertext ct_(x→), as indicated by Formula 140. for j=1, . . . , 4 C _(1,j) :=ωB _(1,j)+η₁ B _(4j), C _(2,1):=Σ_(L=1) ^(n) x _(L)(ωB _(1,j,L)′+η₁ B _(4,j,L)′)  [Formula 140]

(S126: Element c₃ Generation Step)

With the processing device, the cipher element generation part 232 generates element c₃, which is an element of the ciphertext ct_(x→), as indicated by Formula 141. c₃ :=g _(T) ^(ζm)  [Formula 141]

(S127: Data Transmission Step)

For example, with the communication device, the data transmission part 240 transmits the ciphertext ct_(x→), constituted by as elements: the vector x^(→)inputted in S122, the element c₀ generated in S124; the elements C_(1,j) and C_(2,j) generated in S125; and the element c₃ generated in S126, to the decryption device 300 via the network. As a matter of course, the ciphertext ct_(x→) might as well be transmitted to the decryption device 300 by another method.

More specifically, from S121 through S126, the encryption device 200 executes the Enc algorithm indicated by Formula 142, to generate the ciphertext ct_(x→). In S127, the encryption device 200 transmits the generated ciphertext ct_(x→) to the decryption device 300.

$\begin{matrix} {{{{Enc}\left( {{p\; k},m,\overset{->}{x}} \right)}\text{:}}{\omega,\eta_{0},\eta_{1},{\zeta\overset{\bigcup}{\longleftarrow}{??}_{q}},{c_{0}:=\left( {{- \omega},0,\zeta,0,\eta_{0}} \right)_{{??}_{0}}},{c_{3}:={g_{T}^{\zeta}m}},{C_{1,j}:={{\omega\; B_{1,j}} + {\eta_{1}B_{4\; j}}}},{C_{2,j}:={\sum\limits_{L = 1}^{n}{x_{L}\left( {{\omega\; B_{1,j,L}^{\prime}} + {\eta_{1}B_{4,j,L}^{\prime}}} \right)}}}}{{{{for}\mspace{14mu} j} = 1},\ldots\mspace{14mu},4,{{{return}\mspace{14mu}{ct}_{\overset{->}{x}}}:={\left( {\overset{->}{x},c_{0},\left\{ {C_{1,j},C_{2,j}} \right\}_{{j = 1},\ldots\mspace{14mu},4},c_{3}} \right).}}}} & \left\lbrack {{Formula}\mspace{14mu} 142} \right\rbrack \end{matrix}$

The decryption device 300 will be described.

As shown in FIG. 5, the decryption device 300 is provided with a decryption key acquisition part 310, a data reception part 320, a pairing operation part 330, and a message calculation part 340.

The process of the Dec algorithm will be described with reference to FIG. 9.

(S131: Decryption key Acquisition Step)

For example, with the communication device, the decryption key acquisition part 310 acquires sk_(→) distributed by the key generation device 100, via the network.

The decryption key acquisition part 310 also acquires the public parameters pk generated by the key generation device 100.

(S132: Data Reception Step)

For example, with the communication device, the data reception part 320 receives the ciphertext ct_(x→) transmitted by the encryption device 200, via the network.

(S133: Value D*_(j) Calculation Step)

With the processing device, the pairing operation part 330 calculates value D*_(j), as indicated by Formula 143. for j=1, . . . , 4 D _(j)*:=Σ_(L=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ x _(L))K _(j−1)n+L)*  [Formula 143]

Note that the element k*₁ is parsed as 4n-tuples (K*₁, K_(4n)*)ε G^(4n).

(S134: Pairing Operation Step)

With the processing device, the pairing operation part 330 executes a pairing operation, as indicated by Formula 144, to calculate value F. F:=e(c ₀ ,k ₀*)·Π_(i=1) ⁴(e(C _(1,i) ,D _(j)*)·e(C _(2,j) ,K _(jn)*))  [Formula 144]

(S135: Message Calculation Step)

With the processing device, the message calculation part 340 calculates a message m′, as indicated by Formula 145. m′:=c ₃ /F  [Formula 145]

More specifically, from S131 through S 135, the decryption device 300 executes the Dec algorithm indicated by Formula 146, to calculate the message m′. Dec(pk,sk _({right arrow over (v)}):=({right arrow over (v)},k ₀ *,k ₁*), ct _({right arrow over (x)}):=({right arrow over (x)},c ₀ ,{C _(1,j) ,C _(2,j)}_(j=1, . . . , 4) , c ₃)): Parse k ₁* as a 4n-tuple (K ₁ *, . . . , K _(4n)*)ε

^(4n), D _(j)*:=Σ_(L=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ ^(x) L)K _((j−1)n+L)* for j=1, . . . , 4 F:=e(c ₀ ,k ₀*)·Π_(j=1) ⁴(e(C _(1,j) ,D _(j)*)·e(C _(2,j) ,K _(jn)*)), return m′:=c ₃ /F.  [Formula 146]

Formula 133 indicates that B₁:=(b_(1,1), b_(1,4n)) is specified by {B_(i,j), B′_(i,j,L)}_(i,j=1, . . . ,4;L=1, . . . ,n). Also, {B_(i,j), B′_(i,j,L)}_(i=1,4;j=1, . . . 4;L=1, . . . ,n) included in an output of the Setup algorithm is specified by B^₁:=(b_(1,1), . . . , b_(1,n), b_(1,3n+1), b_(1,4n)).

The Dec algorithm can be described as Dec′ algorithm indicated by Formula 147.

$\begin{matrix} {{{{Dec}^{\prime}\left( {{p\; k},{{sk}_{\overset{->}{v}}:=\left( {\overset{->}{v},k_{0}^{*},k_{1}^{*}} \right)},{{ct}_{\overset{->}{x}}:=\left( {\overset{->}{x},c_{0},\left\{ {C_{1,j},C_{2,j}} \right\}_{{j = 1},\ldots\mspace{14mu},4},c_{3}} \right)}} \right)}\text{:}}{{c_{1}:=\left( {{\overset{\overset{n}{︷}}{{x_{1}C_{1,1}},\ldots\mspace{14mu},{x_{n - 1}C_{1,1}},C_{2,1}}\mspace{14mu}\ldots}\mspace{14mu},\overset{\overset{n}{︷}}{{x_{1}C_{1,4}},\ldots\mspace{14mu},{x_{n - 1}C_{1,4}},C_{2,4}}}\; \right)},\mspace{79mu}{{that}\mspace{14mu}{is}},\mspace{79mu}{c_{1} = \begin{pmatrix} {\overset{\overset{n}{︷}}{\omega\;\overset{->}{x}},} & {\overset{\overset{n}{︷}}{0^{n}},} & {\overset{\overset{n}{︷}}{0^{n}},} & \overset{\overset{n}{︷}}{\eta_{1}\overset{->}{x}} \end{pmatrix}_{{??}_{1}}},\mspace{79mu}{F:={{e\left( {c_{0},k_{0}^{*}} \right)} \cdot {e\left( {c_{1},{\left( {\overset{->}{x} \cdot \overset{->}{v}} \right)^{- 1}k_{1}^{*}}} \right)}}},\mspace{79mu}{{{return}\mspace{14mu} m^{\prime}}:={c_{3}/{F.}}}}} & \left\lbrack {{Formula}\mspace{14mu} 147} \right\rbrack \end{matrix}$

As indicated by Formula 148, using the Dec′ algorithm, F=g^(ζ) _(T) is obtained if x^(→)·v^(→)≠0. Hence, the message m′ (=m) can be obtained by dividing c₃=g^(ζ) _(T)m by F.

$\begin{matrix} {\begin{matrix} {F = {{e\left( {c_{0},k_{0}^{*}} \right)} \cdot {e\left( {c_{1},{\left( {\overset{->}{x} \cdot \overset{->}{v}} \right)^{- 1}k_{1}^{*}}} \right)}}} \\ {= {g_{T}^{{{- \omega}\;\delta} + \zeta}g_{T}^{\omega\;{{\delta({\overset{->}{x} \cdot \overset{->}{v}})}/{({\overset{->}{x} \cdot \overset{->}{v}})}}}}} \\ {= g_{T}^{\zeta}} \end{matrix}{{{if}\mspace{14mu}{x \cdot v}} \neq 0.}} & \left\lbrack {{Formula}\mspace{14mu} 148} \right\rbrack \end{matrix}$

In the non-zero inner-product encryption scheme explained in Embodiment 2, the ciphertext ct_(x→) includes a total of 13 elements of G, namely, 5 by element c₀ indicated by Formula 139 and 8 by elements C_(1,j) and C_(2,j) for each integer j of j=1, . . . , 4 indicated by Formula 140. Also, the ciphertext ct_(x→) includes 1 element of G_(T), namely, 1 by element c₃ indicated by Formula 141. In fine, the ciphertext ct_(x→) has a constant size in n.

Also, in the non-zero innerproduct encryption scheme explained in Embodiment 2, the decryption process (Dec algorithm) executes a total of only 13 pairing operations, namely, 5 by e(c₀, k*₀) and 8 by Π_(j=1) ⁴(e(C_(1,j), D*_(j))·e(C_(2,j), K_(jn)*)) indicated by Formula 144. In fine, the decryption process requires only a small number of pairing operations.

Embodiment 3

In Embodiment 3, a nonzero inner-product encryption scheme having a constant-size secret key will be described.

The configurations of a key generation device 100, an encryption device 200, and a decryption device 300 are respectively the same as the configurations of the key generation device 100, the encryption device 200, and the decryption device 300 shown in FIGS. 3, 4, and 5 according to Embodiment 2.

FIGS. 10 and 11 are flowcharts showing the operation of the key generation device 100 according to Embodiment 3, in which FIG. 10 is a flowchart showing the process of Setup algorithm according to Embodiment 3, and FIG. 11 is a flowchart showing the process of KeyGen algorithm according to Embodiment 3. FIG. 12 is a flowchart showing the operation of the encryption device 200 according to Embodiment 3, that is, a flowchart showing the process of Enc algorithm according to Embodiment 3. FIG. 13 is a flowchart showing the operation of the decryption device 300 according to Embodiment 3, that is, a flowchart showing the process of Dec algorithm according to Embodiment 3.

In the following description, let a vector v^(→):=(v₁, . . . , v_(n)) to be inputted hold v_(L)≠0 for each integer L of L=1, . . . , n−1, and let a vector x^(→):=(x₁, . . . , x_(n)) to be inputted hold x_(n)≠0.

The key generation device 100 will be described.

The process of the Setup algorithm will be described with reference to FIG. 10.

The processes of S201 to S202 are the same as the processes of S101 to S102 shown in FIG. 6.

(S203: Basis B Generation Step)

With a processing device, a basis generation part 113 generates a basis D₀ and variables D_(i,j) and D′_(i,j,L), as indicated by Formula 149, in the same manner as the basis B₀ and the variable B_(i,j) of Embodiment 2 are. b _(0,i):=(χ_(0,i,1), . . . , χ_(0,i,5)

=Σ_(j=1) ⁵χ_(0,i,j)α_(j) for i=1, . . . , 5,

₀:=(b _(0,1) , . . . , b _(0,5)), D _(i,j):=μ_(i,j) g, D _(i,j,L)′:=μ_(i,j,L) ′g for i,j=1, . . . , 4: L=1, . . . , n  [Formula 149]

With the processing device, the basis generation part 113 also generates a basis D*₀ and a basis D*₁, as indicated by Formula 150, in the same manner as the basis B*₀ and the basis B*₁ of Embodiment 2 are. for t=0,1 (θ_(t,i,j))_(i,j=1, . . . , N) _(t) :=ψ·(X _(t) ^(T))⁻¹, b _(t,i)*:=(θ_(t,i,1), . . . , θ_(t,i,N) _(t)

=Σ_(j=1) ^(N) ^(t) θ_(t,i,j)α_(j) for i=1, . . . , N _(t),

_(t)*:=(b _(t,1) *, . . . , b _(t,N) _(t) *)  [Formula 150]

Then, the basis generation part 113 treats the basis D*₀ as a basis B₀, the basis D₀ as a basis B*₀, and the basis D*₁ as a basis B₁. Also, for each of integers i, j of i, j=1, . . . , 4 and each integer L of L=1, n, the basis generation part 113 treats the variable D_(i,j) as a variable B*_(i,j) and the variable D′_(i,j,L), as a variable B′*_(i,j,L).

(S204: Basis B^Generation Step)

With the processing device, a key generation part 114 generates bases B^₀, B^₁, and B^*₀, as indicated by Formula 151.

₀:=(b _(0,1) ,b _(0,3) ,b _(0,5)),

₀*:=(b _(0,1) *,b _(0,3) *,b _(0,4)*),

₁*:=(b _(1,1) *, . . . , b _(1,n) *,b _(1,2n+1) *, . . . b _(1,3n)*)  [Formula 151]

(S205: Master Key Generation Step)

With the processing device, the key generation part 114 sets public parameters pk:=(1^(λ), param_(n), {B^_(t)}_(t=0,1)), and master secret key sk:=B^*₀, {B*_(i,j), B′*_(i,j,L)}_(i=1,3;j=1, . . . ,4;L=1, . . . ,n). Then, the key generation part 114 stores the public parameters pk and the master secret key sk in a master key storage part 120.

Note param_(n):=({param_(Vt)}_(t=0,1), g_(T)).

More specifically, from S201 through S205, the key generation device 100 executes the Setup algorithm indicated by Formula 153 using algorithm G⁽²⁾)_(ob) indicated by Formula 152, to generate the public parameters pk and the master secret key sk. As indicated by Formula 152, the algorithm G⁽²⁾ _(ob) employs algorithm G⁽¹⁾ _(ob) indicated by Formula 131.

$\begin{matrix} {\mspace{79mu}{{{{??}_{ob}^{(2)}\left( {1^{\lambda},n} \right)}\text{:}}{{\left( {{param}_{n},{??}_{0},{??}_{0}^{*},\left\{ {D_{i,j},D_{i,j,L}^{\prime}} \right\}_{i,{j = 1},\;\ldots\mspace{11mu},{4;\;{L = 1}},\;\ldots\mspace{11mu},n},{??}_{1}^{*}} \right)\overset{R}{\longleftarrow}{{??}_{ob}^{(1)}\left( {1^{\lambda},n} \right)}},{{??}_{0}:={??}_{0}^{*}},{{??}_{0}^{*}:={??}_{0}},{{??}_{1}:={??}_{1}^{*}},{B_{i,j}^{*}:=D_{i,j,}},{B_{i,j,L}^{\prime*} = D_{i,j,L}^{\prime}}}\mspace{79mu}{{{for}\mspace{14mu} i},{j = 1},{{\ldots\mspace{14mu} 4};{L = 1}},\ldots\mspace{14mu},n,{{return}\mspace{14mu}{\left( {{{param}_{n,}{??}_{0}},{??}_{0}^{*},{??}_{1},\left\{ {B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{i,{j = 1},\;\ldots\;,\mspace{11mu}{4;\;{L = 1}},\;\ldots\;,n}} \right).}}}}} & \left\lbrack {{Formula}\mspace{14mu} 152} \right\rbrack \\ {\mspace{79mu}{{{{Setup}\left( {1^{\lambda},n} \right)}\text{:}}{{\left( {{{param}_{n,}{??}_{0}},{??}_{0}^{*},{??}_{1},\left\{ {B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{i,{j = 1},\;\ldots\mspace{14mu},\;{4;\;{L = 1}},\;\ldots\;,n}} \right)\overset{R}{\longleftarrow}{{??}_{ob}^{(2)}\left( {1^{\lambda},n} \right)}},\mspace{79mu}{{\hat{??}}_{0}:=\left( {b_{0,1},b_{0,3},b_{0,5}} \right)},\mspace{79mu}{{\hat{??}}_{0}^{*}:=\left( {b_{0,1}^{*},b_{0,3}^{*},b_{0,4}^{*}} \right)},\mspace{79mu}{{\hat{??}}_{1}:=\left( {{b_{1,1,\;\ldots\mspace{11mu},}b_{1,n}},{b_{1,{{3\; n} + 1},\;\ldots\;,}b_{1,{4\; n}}}} \right)},\mspace{79mu}{{{return}\mspace{14mu} p\; k}:=\left( {1^{\lambda},{param}_{n},\left\{ {\hat{??}}_{t} \right\}_{{t = 0},1}} \right)},\mspace{79mu}{{sk}:={\left( {{\hat{??}}_{0}^{*},\left\{ {B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{{i = 1},{3;\;{j = 1}},\mspace{11mu}\ldots\;,\;{4;\;{L = 1}},\;\ldots\;,n}} \right).}}}}} & \left\lbrack {{Formula}\mspace{14mu} 153} \right\rbrack \end{matrix}$

Note that the public parameters are publicized via, e.g., a network, so the encryption device 200 and decryption device 300 can acquire them.

The process of the KeyGen algorithm will be described with reference to FIG. 11.

The processes of S211 to S213 are the same as the processes of S111 to S113 shown in FIG. 7.

(S214: Element K* Generation Step)

With the processing device, a key element generation part 142 generates elements K*_(1,j) and K*_(2,j) which are elements of a decryption key sk_(v→), as indicated by Formula 154. for j=1, . . . , 4 K _(1,j) *:=δB _(1,j)*+φ₁ B _(3,k)*, K _(2,j)*:=Σ_(L=1) ^(n) v _(L)(δB _(i,j,L)′*+φ₁ B _(3,j,L)′*)  [Formula 154]

(S215: Key Distribution Step)

For example, with a communication device, a key distribution part 150 distributes the decryption key sk_(v→), constituted by as elements: the vector v^(→) inputted in S211; an element k*₀ generated in S213; and the elements K*_(1,j) and K*_(2,j) generated in S214, to the decryption device 300 in secrecy via the network. As a matter of course, the decryption key sk_(v→) might as well be distributed to the decryption device 300 by another method.

More specifically, from S211 through S214, the key generation device 100 executes the KeyGen algorithm indicated by Formula 155, to generate the decryption key sk_(v→). Then, in S215, the key generation device 100 distributes the generated decryption key sk_(v→) to the decryption device 300.

$\begin{matrix} {{{{KeyGen}\left( {{p\; k},{sk},\overset{->}{v}} \right)}\text{:}}{\delta,\varphi_{0},{\varphi_{1}\overset{\bigcup}{\longleftarrow}{??}_{q}},{k_{0}^{*}:=\left( {\delta,0,1,\varphi_{0},0} \right)_{{??}_{0}^{*}}},{K_{1,j}^{*}:={{\delta\; B_{1,j}^{*}} + {\varphi_{1}B_{3,j}^{*}}}},{K_{2,j}^{*}:={\sum\limits_{L = 1}^{n}{v_{L}\left( {{\delta\; B_{1,j,L}^{\prime*}} + {\varphi_{1}B_{3,j,L}^{\prime*}}} \right)}}}}{{{for}\mspace{14mu} j} = 1},\ldots\mspace{14mu},4,{{{return}\mspace{14mu}{sk}_{\overset{->}{v}}}:={\left( {\overset{->}{v},k_{0}^{*},\left\{ {K_{1,j}^{*},K_{2,j}^{*}} \right\}_{{j = 1},\;\ldots\;,\; 4}} \right).}}} & \left\lbrack {{Formula}\mspace{14mu} 155} \right\rbrack \end{matrix}$

The encryption device 200 will be described.

The process of the Enc algorithm will be described with reference to FIG. 12.

The processes of S221 to S224 are the same as the processes of S 121 to S124 shown in FIG. 8.

(S225: Element c₁ Generation Step)

With the processing device, a cipher element generation part 232 generates element c₁, which is an element of a ciphertext ct_(x→), as indicated by Formula 156. c ₁:=(ω{right arrow over (x)},0^(n),0^(n),η₁ {right arrow over (x)}

  [Formula 156]

As with Formula 135, Formula 156 means that: ω_(x1), . . . , ω_(xn) are each set as the coefficient for basis vectors b*_(1,1), . . . b*_(1,n) of the basis B₁; 0 is set as the coefficient for basis vectors b*_(1,n+1), . . . , b*_(1,3n); and η₁x₁, . . . , η₁x_(n) are each set as the coefficient for basis vectors b*_(1,3n+1), . . . , b*_(1,4n).

The process of S226 is the same as the process of S126 shown in FIG. 8.

(S227: Data Transmission Step)

For example, with the communication device, a data transmission part 240 transmits the ciphertext ct_(x→), constituted by as elements: the vector x^(→) inputted in S222; an element c₀ generated in S224; the element C₁ generated in S225; and an element c₃ generated in S226, to the decryption device 300 via the network. As a matter of course, the ciphertext ct_(x→) might as well be transmitted to the decryption device 300 by another method.

More specifically, from S221 through S226, the encryption device 200 executes the Enc algorithm indicated by Formula 157, to generate the ciphertext ct_(x→). In S227, the encryption device 200 transmits the generated ciphertext ct_(x→) to the decryption device 300.

$\begin{matrix} {{{{Enc}\left( {{p\; k},m,\overset{->}{x}} \right)}\text{:}}{\omega,\eta_{0},\eta_{1},{\zeta\overset{\bigcup}{\longleftarrow}{??}_{q}},{c_{0}:=\left( {{- \omega},0,\varsigma,0,\eta_{0}} \right)_{{??}_{0}}},{c_{1}:=\left( {{\omega\;\overset{->}{x}},0^{n},0^{n},{\eta_{1}\overset{->}{x}}} \right)_{{??}_{1}}},{c_{3}:={g_{T}^{\zeta}m}},{{{return}\mspace{14mu}{ct}_{\overset{->}{x}}}:={\left( {x,c_{0},c_{1},c_{3}} \right).}}}} & \left\lbrack {{Formula}\mspace{14mu} 157} \right\rbrack \end{matrix}$

The decryption device 300 will be described.

The process of the Dec algorithm will be described with reference to FIG. 13.

The processes of S231 to S232 are the same as the processes of S131 to S132 shown in FIG. 9.

(S233: Value D_(j) Calculation Step)

With the processing device, a pairing operation part 330 calculates value D_(j), as indicated by Formula 158. for j=1, . . . , 4 D _(j):=Σ_(L=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ v _(L))C _((j−1)n+L)  [Formula 158]

Note that the element c₁ is parsed as 4n-tuples (C₁, . . . , C_(4n))ε G^(4n).

(S234: Pairing Operation Step)

With the processing device, the pairing operation part 330 executes a pairing operation, as indicated by Formula 159, to calculate value F. F:=e(c ₀ ,k ₀*)·Π_(j=1) ⁴(e(D _(j) , K _(1,j)*)·e(C _(jn) ,K _(2,j)*))  [Formula 159]

The process of S235 is the same as the process of S135 shown in FIG. 9.

More specifically, from S231 through S235, the decryption device 300 executes the Dec algorithm indicated by Formula 160, to calculate a message m′. Dec(pk,sk _({right arrow over (v)}):=({right arrow over (v)},k ₀ *,{K _(1,j) *, K _(2,j)*}_(j=1, . . . , 4)), ct _({right arrow over (x)}):=({right arrow over (x)},c ₀ ,c ₁ ,c ₃)): Parse c ₁ as a 4n-tuple (C ₁ , . . . ,C _(4n))ε

^(4n), D _(j)*:=Σ_(L=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ ^(v) L)C _((j−1)n+L) for j=1, . . . , 4 F:=e(c ₀ ,k ₀*)·Π_(j=1) ⁴(e(D _(j) ,K _(j)*)·e(C _(jn) ,K _(2,j)*)), return m′:=c ₃ /F.  [Formula 160]

Note that B*₁ (b*_(1,1), . . . , b*_(1,4n)) is specified by {B*_(i,j), B′*_(i,j,L)}_(i,j=1, . . . ,4;L=1, . . . ,n). Also, {B*_(i,j),B′*_(i,j,l)}_(i=1,3;j=1, . . . , 4;L=1, . . . , n) included in an output of the Setup algorithm is specified by B^*₁:=(b*_(1,1), . . . , b*_(1,n), b*_(1,2n+1), . . . , b*_(1,3n)).

The Dec algorithm can be described as Dec′ algorithm indicated by Formula 161.

$\begin{matrix} {{{{Dec}^{\prime}\left( {{p\; k},{{sk}_{\overset{->}{v}}:=\left( {\overset{->}{v},k_{0}^{*},\left\{ {K_{1,j}^{*},K_{2,j}^{*}} \right\}_{{j = 1},\ldots\mspace{14mu},4}} \right)},{{ct}_{\overset{->}{x}}:=\left( {\overset{->}{x},c_{0},c_{1},c_{3}} \right)}} \right)}\text{:}}{k_{1}^{*}:=\left( {{\overset{\overset{n}{︷}}{{v_{1}K_{1,1}^{*}},\ldots\mspace{14mu},{v_{n - 1}K_{1,1}^{*}},K_{2,1}^{*},}\mspace{14mu}\ldots}\mspace{14mu},\left. \quad\overset{\overset{n}{︷}}{{v_{1}K_{1,4}^{*}},\ldots\mspace{14mu},{v_{n - 1}K_{1,4}^{*}},K_{2,4}^{*}} \right),\mspace{79mu}{{that}\mspace{14mu}{is}},\mspace{79mu}{k_{1}^{*} = \left( {{\delta\;\overset{->}{v}},0^{n},0^{n},{\varphi_{1}\overset{->}{v}}} \right)_{{??}_{1}}},\mspace{79mu}{F:={{e\left( {c_{0},k_{0}^{*}} \right)} \cdot {e\left( {{\left( {\overset{->}{x} \cdot \overset{->}{v}} \right)^{- 1}c_{1}},k_{1}^{*}} \right)}}},\mspace{79mu}{{{return}\mspace{14mu} m^{\prime}}:={c_{3}/{F.}}}} \right.}} & \left\lbrack {{Formula}\mspace{14mu} 161} \right\rbrack \end{matrix}$

In the non-zero inner-product encryption scheme explained in Embodiment 3, the decryption key sk_(v→) includes a total of 13 elements of G, namely, 5 by element k*₀ indicated by Formula 135 and 8 by elements K*₁; and K*₂; for each integer j of j=1, . . . , 4 indicated by Formula 154. In fine, the decryption key sk_(y), has a constant size in n.

Also, in the non-zero inner-product encryption scheme explained in Embodiment 3, the decryption process (Dec algorithm) executes a total of only 13 pairing operations, namely, 5 by e(c₀, k*₀) and 8 by Π_(j=1) ⁴(e(D_(j), K*_(1,j))·e(C_(jn), K_(2,j)*) indicated by Formula 159. In fine, the decryption process requires only a small number of pairing operations.

Embodiment 4

In Embodiment 4, a zero inner-product encryption scheme having a constant-size ciphertext will be described.

The configurations of a key generation device 100, an encryption device 200, and a decryption device 300 are respectively the same as the configurations of the key generation device 100, the encryption device 200, and the decryption device 300 shown in FIGS. 3, 4, and 5 according to Embodiment 2.

FIGS. 14 and 15 are flowcharts showing the operation of the key generation device 100 according to Embodiment 4, in which FIG. 14 is a flowchart showing the process of Setup algorithm according to Embodiment 4, and FIG. 15 is a flowchart. showing the process of KeyGen algorithm according to Embodiment 4. FIG. 16 is a flowchart showing the operation of the encryption device 200 according to Embodiment 4, that is, a flowchart showing the process of Enc algorithm according to Embodiment 4. FIG. 17 is a flowchart showing the operation of the decryption device 300 according to Embodiment 4, that is, a flowchart showing the process of Dec algorithm according to Embodiment 4.

In the following description, let a vector x^(→):=(x₁, . . . , x_(n)) to be inputted hold x_(L)≠0 for each integer L of L=1, . . . , n−1, and let a vector v^(→):=(v₁, . . . , v_(n)) to be inputted hold v_(n)≠0.

The key generation device 100 will be described.

The process of the Setup algorithm will be described with reference to FIG. 14.

(S301: Space Generation Step)

A space generation part 111 takes security parameter 1^(λ) as an input and executes G_(bpg) with a processing device, to generate parameter param_(G):=(q, G, G_(T), g, e) of symmetric bilinear pairing groups.

Furthermore, the space generation part 111 sets N:=4n+1. Then, the space generation part 111 takes as input the security parameter 1^(λ), N, and the parameter param_(G) of the symmetric bilinear pairing groups and executes G_(dpvs) with the processing device, to generate a parameter param_(vt):=(q, V, G_(T), A, e) of the dual pairing vector spaces.

(S302: Linear Transformation Generation Step)

With the processing device, a matrix generation part 112 generates linear transformation X, as indicated by Formula 162.

$\begin{matrix} {X:={\overset{\bigcup}{\longleftarrow}{\mathcal{L}^{\prime}\left( {N,{??}_{q}} \right)}}} & \left\lbrack {{Formula}\mspace{14mu} 162} \right\rbrack \end{matrix}$

Note that L′(N, F_(q)) in Formula 162 is as indicated by Formula 163.

$\begin{matrix} {{{\mathcal{L}^{\prime}\left( {N,{??}_{q}} \right)}:={\left\{ {X:={\begin{pmatrix} \chi_{0,0} & {\chi_{0,1}{\overset{->}{e}}_{n}} & \ldots & {\chi_{0,4}{\overset{->}{e}}_{n}} \\ {\overset{->}{\chi}}_{1,0}^{T} & X_{1,1} & \ldots & X_{1,4} \\ \vdots & \vdots & \; & \vdots \\ {\overset{->}{\chi}}_{4,0}^{T} & X_{4,1} & \ldots & X_{4,4} \end{pmatrix}❘\begin{matrix} {{X_{i,j} \in {\mathcal{H}\left( {n,{??}_{q}} \right)}},} \\ {{\overset{->}{\chi}}_{i,0}:=} \\ {\left( \chi_{i,0,L} \right)_{{L = 1},\ldots\mspace{14mu},n} \in} \\ {{??}_{q}^{n},} \\ {\chi_{0,0},{\chi_{0,j} \in {??}_{q}}} \\ {{for}\mspace{14mu}} \\ {i,{j = 1},\ldots\mspace{14mu},4} \end{matrix}}} \right\}\mspace{79mu}\bigcap{{GL}\left( {N,{??}_{q}} \right)}}},{{\mathcal{H}\left( {n,{??}_{q}} \right)}:=\left\{ {\begin{pmatrix} u & \; & \; & u_{1}^{\prime} \\ \; & \ddots & \; & \vdots \\ \; & \; & u & u_{n - 1}^{\prime} \\ \; & \; & \; & u_{n}^{\prime} \end{pmatrix}❘\begin{matrix} {u,{{u_{L}^{\prime} \in {{??}_{q}\mspace{14mu}{for}\mspace{14mu} L}} = 1},\ldots\mspace{14mu},n,} \\ {a\mspace{14mu}{blank}\mspace{14mu}{element}\mspace{14mu}{in}\mspace{14mu}{the}\mspace{14mu}{matrix}} \\ {{{denotes}\mspace{14mu} 0} \in {??}_{q}} \end{matrix}} \right\}}} & \left\lbrack {{Formula}\mspace{14mu} 163} \right\rbrack \end{matrix}$

Note that {χ_(0,0), χ_(0,j), χ_(i,0,L), μ_(i,j), μ′_(i,j,L)}_(i,j=1, . . . , 4;L=1, . . . , n) in the following description denotes an element other than constant value 0 in the linear transformation X.

(S303: Basis B Generation Step)

With the processing device, a basis generation part 113 generates variables B_(0,0), B_(0,j), B_(i,0,L), B_(i,j), and B′_(i,j,L), as indicated by Formula 164. for i,j=1, . . . , 4;L=1, . . . , n B _(0,0):=χ_(0,0) g, B _(0,j):=χ_(0,j) g, B _(i,0,L):=χ_(i,0,L) g, B _(i,j):=μ_(i,j) g, B _(i,j,L)′:=μ_(i,j,L) ′g  [Formula 164]

With the processing device, the basis generation part 113 also generates a basis B*, as indicated by Formula 165. (θ_(i,j))_(i,j=0, . . . , 4n):=ψ·(X ^(T))⁻¹, b _(t,i)*:=(θ_(i,1), . . . , θ_(i,N))_(θ)==Σ_(j=0) ^(4n)θ_(i,j)α_(j) for i=0, . . . , 4n,

*:=(b ₀ *, . . . , b _(4nt)*)  [Formula 165]

(S304: Basis B^ Generation Step)

With the processing device, a key generation part 114 generates a basis B^*₀, as indicated by Formula 166.

*:=(b ₀ *, . . . , b _(n) *, b _(2n+1) *, . . . , b _(3n)*)  [Formula 166]

(S305: Master Key Generation Step)

With the processing device, the key generation part 114 sets public parameters pk:=(1^(λ),param_(n), B^₀, {B_(0,0), B_(0,j), B_(1,0,L), B_(i,j), B′_(i,j,L)}_(i=1,4;j=1, . . . , 4;L=1, . . . , n)), and master secret key sk:=B^*. Then, the key generation part 114 stores the public parameters pk and the master secret key sk in a master key storage part 120.

Note param_(n):=(param_(v), g_(T)).

More specifically, from S301 through S305, the key generation device 100 executes the Setup algorithm indicated by Formula 168 using algorithm G⁽³⁾ _(ob) indicated by Formula 167, to generate the public parameters pk and the master secret key sk.

$\begin{matrix} {\mspace{79mu}{{{{??}_{ob}^{(3)}\left( {1^{\lambda},n} \right)}\text{:}}\mspace{76mu}{{{param}_{??}:={\left( {q,{??},{??}_{T},g,e} \right)\overset{R}{\longleftarrow}{{??}_{bpg}\left( 1^{\lambda} \right)}}},\mspace{79mu}{N:={{4\; n} + 1}},\mspace{79mu}{\psi\overset{\bigcup}{\longleftarrow}{??}_{q}^{\times}},{g_{T}:={e\left( {g,g} \right)}^{\psi}},}}} & \left\lbrack {{Formula}\mspace{14mu} 167} \right\rbrack \\ {{{param}_{??}:={\left( {q,{??},{??}_{T},{??},e} \right):={{??}_{dpvs}\left( {1^{\lambda},N,{param}_{??}} \right)}}},\mspace{79mu}{{param}_{n}:=\left( {{param}_{??},g_{T}} \right)},\mspace{79mu}{X\overset{\bigcup}{\leftarrow}{\mathcal{L}^{\prime}\left( {N,{??}_{q}} \right)}},{hereafter},} & \; \\ {{\left\{ {\chi_{0,0},\chi_{0,j},\chi_{i,0,L},\mu_{i,j},\mu_{i,j,L}^{\prime}} \right\}_{i,{j = 1},\;\ldots\;,\;{4;\;{L = 1}},\;{\ldots\; n}}\mspace{14mu}{denotes}\mspace{14mu}{non}\text{-}{zero}\mspace{14mu}{entities}\mspace{14mu}{of}\mspace{14mu} X},\mspace{79mu}{\left( \vartheta_{i,j} \right)_{i,{j = 0},\;\ldots\;,\;{4\; n}}:={\psi \cdot \left( X^{T} \right)^{- 1}}},} & \; \\ {{{B_{0,0}:={\chi_{0,0}g}},{B_{0,j}:={\chi_{0,j}g}},{B_{i,0,L}:={\chi_{i,0,L}g}},{B_{i,j}:={\mu_{i,j}g}},{B_{i,j,L}^{\prime}:={\mu_{i,j,L}^{\prime}g}}}\mspace{79mu}{{{for}\mspace{14mu} i},{j = 1},\ldots\mspace{14mu},{4;{L = 1}},\ldots\mspace{11mu},n,\mspace{79mu}{b_{i}^{*}:={\left( {\vartheta_{i,1,\;\ldots\;,}\vartheta_{i,N}} \right)_{??} = {\sum\limits_{j = 0}^{4\; n}{\vartheta_{i,j}a_{j}}}}}}\mspace{79mu}{{{{for}\mspace{14mu} i} = 0},\ldots\mspace{14mu},{4\; n},{{??}^{*}:=\left( {b_{0}^{*},\ldots\mspace{14mu},b_{4\; n}^{*}} \right)},}} & \; \\ {{return}\mspace{14mu}{\left( {{param}_{n},\left\{ {B_{0,0},B_{0,j},B_{i,0,L},B_{i,j},B_{i,j,L}^{\prime}} \right)_{i,{j = 1},\;\ldots\;,\;{4;\;{L = 1}},\;{\ldots\; n}},{??}^{*}} \right).}} & \; \\ {\mspace{79mu}{{{{Setup}\left( {1^{\lambda},n} \right)}\text{:}}{{\left( {{param}_{n},{\left\{ {B_{0,0},B_{0,j},B_{i,0,L},B_{i,j},B_{i,j,L}^{\prime}} \right\}_{i,{j = 1},\;\ldots\;,{4;\;{L = 1}},\;\ldots\;,\; n,}{??}^{*}}} \right)\;\overset{R}{\leftarrow}{{??}_{ob}^{(3)}\left( {1^{\lambda},n} \right)}},\mspace{79mu}{{\hat{??}}^{*}:=\left( {b_{0}^{*},\ldots\;,b_{n}^{*},b_{{2n} + 1}^{*},\ldots\mspace{14mu},b_{3\; n}^{*}} \right)},{{{return}\mspace{14mu} p\; k}:=\left( {1^{\lambda},{param}_{n},\left\{ {B_{0,0},B_{0,j},B_{i,0,L},B_{i,j},B_{i,j,L}^{\prime}} \right\}_{{i = 1},{4;\;{j = 1}},\;\ldots\;,{4;\;{L = 1}},\;\ldots\;,n}} \right)},\mspace{79mu}{{sk}:=\;{{\hat{??}}^{*}.}}}}} & \left\lbrack {{Formula}\mspace{14mu} 168} \right\rbrack \end{matrix}$

Note that the public parameters are publicized via, e.g., a network, so the encryption device 200 and decryption device 300 can acquire them.

The process of the KeyGen algorithm will be described with reference to FIG. 15.

The process of S311 is the same as the process of S111 shown in FIG. 7.

(S312: Random Number Generation Step)

With the processing device, a random number generation part 141 generates random numbers, as indicated by Formula 169.

$\begin{matrix} {\;{\delta,{\varphi\;\overset{U}{\left. \longleftarrow\; \right.}{??}_{q}}}} & \left\lbrack {{Formula}\mspace{14mu} 169} \right\rbrack \end{matrix}$

(SS313: Element k* Generation Step)

With the processing device, a key element generation part 142 generates element k*, which is an element of a decryption key sk_(v→), as indicated by Formula 170.

$\begin{matrix} {k^{*}:={\left( {1,\overset{\overset{n}{︷}}{\delta\;\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}},\overset{\overset{n}{︷}}{\varphi\;\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}}} \right){??}^{*}}} & \left\lbrack {{Formula}\mspace{14mu} 170} \right\rbrack \end{matrix}$

As with Formula 135, Formula 170 means that: 1 is set as the coefficient for basis vector b*₀ of a basis B*; δv₁, . . . , δv_(n) are each set as the coefficient for basis vectors b*₁, b*_(n); 0 is set as the coefficient for basis vectors b*_(n+1), . . . , b*_(2n); φv₁, . . . , φv_(n) are each set as the coefficient for basis vectors b*_(2n+1), . . . , b*_(3n); and 0 is set as the coefficient for basis vectors b*_(3n+1), . . . , b*_(4n).

(S314: Key Distribution Step)

For example, with the communication device, a key distribution part 150 distributes the decryption key sk_(v→), constituted by as elements, the element k* generated in S313, to the decryption device 300 in secrecy via the network. As a matter of course, the decryption key sk_(v→) might as well be distributed to the decryption device 300 by another method.

More specifically, from S311 through S313, the key generation device 100 executes the KeyGen algorithm indicated by Formula 171, to generate the decryption key sk_(v→). Then, in S314, the key generation device 100 distributes the generated decryption key sk_(v→) to the decryption device 300.

$\begin{matrix} {{{{KeyGen}\left( {{pk},{sk},\overset{\rightarrow}{v}} \right)}\text{:}\mspace{14mu}\delta},{\varphi\mspace{11mu}\overset{U}{\left. \longleftarrow\; \right.}{??}_{q}},{k^{*}:={\left( {1,\overset{\overset{n}{︷}}{\delta\;\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}},\overset{\overset{n}{︷}}{\varphi\;\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}}} \right){??}^{*}}},{{{return}\mspace{14mu}{sk}_{\overset{\rightarrow}{v}}}:={k^{*}.}}} & \left\lbrack {{Formula}\mspace{14mu} 171} \right\rbrack \end{matrix}$

The encryption device 200 will be described.

The process of the Enc algorithm will be described with reference to FIG. 16.

The processes of S321 to S322 are the same as the processes of S121 to S122 shown in FIG. 8

(S323: Random Number Generation Step)

With the processing device, a random number generation part 231 generates random numbers, as indicated by Formula 172.

$\begin{matrix} {\omega,\eta,{\zeta\mspace{14mu}\overset{U}{\left. \longleftarrow\; \right.}{??}_{q}}} & \left\lbrack {{Formula}\mspace{14mu} 172} \right\rbrack \end{matrix}$

(S324: Element C Generation Step)

With the processing device, a cipher element generation part 232 generates elements C₀, C_(1,j), and C_(2,j), which are elements of a ciphertext ct_(x→), as indicated by Formula 173. C ₀ :=ζB _(0,0)+Σ_(L=1) ^(n) x _(L)(ωB _(1,0,L) +ηB _(4,0,L)), for j=1, . . . , 4 C _(1,j) :=ωB _(1,j) +ηB _(4,j), C _(2,j) :=ζB _(0,j)+Σ_(L=1) ^(n) x _(L)(ωB _(1,j,L) ′+ηB _(4,j,L)′)  [Formula 173]

The process of S325 is the same as the process of S 126 shown in FIG. 8.

(S326: Data Transmission Step)

For example, with the communication device, a data transmission part 240 transmits the ciphertext ct., constituted by as elements: the vector x^(→) inputted in S322, the elements C₀, C_(i,j), and C_(2,j) generated in S324; and an element c₃ generated in S325, to the decryption device 300 via the network. As a matter of course, the ciphertext ct_(x→) might as well be transmitted to the decryption device 300 by another method.

More specifically, from S321 through S325, the encryption device 200 executes the Enc algorithm indicated by Formula 174, to generate the ciphertext ct_(x→). In S326, the encryption device 200 transmits the generated ciphertext ct_(x), to the decryption device 300.

$\begin{matrix} {{{{Enc}\left( {{pk},m,\overset{\rightarrow}{x}} \right)}\text{:}}{\omega,\eta,{\zeta\mspace{14mu}\overset{U}{\left. \longleftarrow\; \right.}{??}_{q}},{C_{0}:={{\zeta\; B_{0,0}} + {\sum\limits_{L = 1}^{n}\;{x_{L}\left( {{\omega\; B_{1,0,L}} + {\eta\; B_{4,0,L}}} \right)}}}},{c_{3}:={g_{T}^{\zeta}m}},{C_{1,j}:={{\omega\; B_{1,j}} + {\eta\; B_{4,j}}}},{C_{2,j}:={{\zeta\; B_{0,j}} + {\sum\limits_{L = 1}^{n}\;{x_{L}\left( {{\omega\; B_{1,j,L}^{\prime}} + {\eta\; B_{4,j,L}^{\prime}}} \right)}}}}}{{{{for}\mspace{14mu} j} = 1},\ldots\mspace{14mu},4,{return}}{{ct}_{\overset{\rightarrow}{x}}:={\left( {\overset{\rightarrow}{x},C_{0},\left\{ {C_{1,j},C_{2,j}} \right\}_{{j = 1},\ldots\mspace{14mu},4},c_{3}} \right).}}} & \left\lbrack {{Formula}\mspace{14mu} 174} \right\rbrack \end{matrix}$

The decryption device 300 will be described.

The process of the Dec algorithm will be described with reference to FIG. 17.

The processes of S331 to S332 are the same as the processes of S131 to S132 shown in FIG. 9.

(S333: Value D*_(j) Calculation Step)

With the processing device, a pairing operation part 330 calculates value D*_(j), as indicated by Formula 175. for j=1, . . . , 4 D _(j)*:=Σ_(L=1) ^(n−1) x _(L) K _((j−1)n+L)*  [Formula 175]

Note that the element k*₁ is parsed as (4n+1)-tuples (K*₀, . . . , K_(4n)*)ε G^(4n+1).

(S334: Pairing Operation Step)

With the processing device, the pairing operation part 330 executes a pairing operation, as indicated by Formula 176, to calculate value F. F=e(c ₀ ,K ₀*)·Π_(j=1) ⁴(e(C _(1,j) ,D _(j)*)·e(C _(2,j) ,K _(jn)*))  [Formula 176]

The process of S335 is the same as the process of S135 shown in FIG. 9.

More specifically, from S331 through S335, the decryption device 300 executes the Dec algorithm indicated by Formula 177, to calculate a message m′. Dec(pk,sk _({right arrow over (v)}) :=k*, ct _({right arrow over (x)}):=({right arrow over (x)},C ₀ ,{C _(1,j) ,C _(2,j)}_(j=1, . . . , 4) , c ₃)): Parse k* as a (4n+1)-tuple (K ₀ *, . . . , K _(4n)*)ε

4n+1, D _(j)*:=Σ_(L=1) ^(n−1) x _(L) K _((j−1)n+L)* for j=1, . . . , 4 F:=e(c ₀ ,K ₀*)·Π_(j=1) ⁴(e(C _(1,j) ,D _(j)*)·e(C _(2,j) ,K _(jn)*)), return m′:=c ₃ /F.  [Formula 177]

Note that B:=(b₀, . . . , b_(4n)) is specified by {B_(0,0), B_(0,j), B_(i,0,L), B_(i,j), B′_(i,j,L)}_(i,j=1, . . . , 4;L=1, . . . n) Also, {B_(0,0), B_(0,j), B_(i,0,L), B_(i,j), B′_(i,j,L)}_(i=1;4;j=1, . . . , 4;L=1, . . . n) included in an output of the Setup algorithm is specified by B^:=(b₀, . . . , b_(n), b_(3n+1), . . . , b_(4n)).

The Dec algorithm can be described as Dec′ algorithm indicated by Formula 178.

$\begin{matrix} {{{{{Dec}^{\prime}\left( {{pk},{{sk}_{\overset{\rightarrow}{v}}:=k^{*}},{{ct}_{\overset{\rightarrow}{v}}:=\left( {\overset{\rightarrow}{x},C_{0},\left\{ {C_{1,j},C_{2,j}} \right\}_{{j = 1},\ldots\mspace{14mu},4},c_{3}} \right)}} \right)}:c}:=\left( {C_{0},\overset{\overset{n}{︷}}{{x_{1}C_{1,1}},\ldots\mspace{14mu},{x_{n - 1}C_{1,1}},C_{2,1}},\ldots\mspace{14mu},\mspace{95mu}\mspace{310mu}\overset{\overset{n}{︷}}{{x_{1}C_{1,4}},\ldots\mspace{14mu},{x_{n - 1}C_{1,4}},C_{2,4}}} \right)},\mspace{76mu}{{that}\mspace{14mu}{is}},{c = {\left( {\zeta,\overset{\overset{n}{︷}}{\omega\;\overset{\rightarrow}{x}},\overset{\overset{n}{︷}}{0^{n}},\overset{\overset{n}{︷}}{0^{n}},\overset{\overset{n}{︷}}{\eta\;\overset{\rightarrow}{x}},} \right){??}}},\mspace{79mu}{F:={e\left( {c,k^{*}} \right)}},\mspace{79mu}{{{return}\mspace{14mu} m^{\prime}}:={c_{3}/{F.}}}} & \left\lbrack {{Formula}\mspace{14mu} 178} \right\rbrack \end{matrix}$

As indicated by Formula 179, using the Dee algorithm, F=g^(ζ) _(T) is obtained if x^(→)·v^(→)=0. Hence, the message m′ (=m) can be obtained by dividing c₃=g^(ζ) _(T)m by F. F=e(c,k)=g _(T) ^(ζ+ωδ{right arrow over (x)}·{right arrow over (v)}) =g _(T) ^(ζ) if {right arrow over (x)}·{right arrow over (v)}=0.  [Formula 179]

In the zero inner-product encryption scheme explained in Embodiment 4, the ciphertext ct_(x→) includes a total of 9 elements of G, namely, 1 by element C₀ and 8 by elements C_(1,j) and C_(2,j) for each integer j of j=1, . . . , 4 indicated by Formula 173. Also, the ciphertext ct_(x→) includes 1 element of G_(T), namely, 1 by element c₃. In fine, the ciphertext ct_(x→) has a constant size in n.

Also, in the zero inner-product encryption scheme explained in Embodiment 4, the decryption process (Dec algorithm) executes a total of only 9 pairing operations, namely, 1 by e(C₀, K*₀) and 8 by Π_(j=1) ⁴(e(C_(1,j), D*_(j))·e(C_(2,j), K*_(jn)) indicated by Formula 176. In fine, the decryption process requires only a small number of pairing operations.

Embodiment 5

In Embodiment 5, a zero inner-product encryption scheme having a constant-size secret key will be described.

The configurations of a key generation device 100, an encryption device 200, and a decryption device 300 are respectively the same as the configurations of the key generation device 100, the encryption device 200, and the decryption device 300 shown in FIGS. 3, 4, and 5 according to Embodiment 2.

FIGS. 18 and 19 are flowcharts showing the operation of the key generation device 100 according to Embodiment 5, in which FIG. 18 is a flowchart showing the process of Setup algorithm according to Embodiment 5, and FIG. 19 is a flowchart showing the process of KeyGen algorithm according to Embodiment 5. FIG. 20 is a flowchart showing the operation of the encryption device 200 according to Embodiment 5, that is, a flowchart showing the process of Enc algorithm according to Embodiment 5. FIG. 21 is a flowchart showing the operation of the decryption device 300 according to Embodiment 5, that is, a flowchart showing the process of Dec algorithm according to Embodiment 5.

In the following description, let a vector v^(→):=(v₁, . . . , v_(n)) to be inputted hold v_(L)≠0 for each integer L of L=1, . . . , n−1, and let a vector x^(→):=(x₁, . . . , x_(n)) to be inputted hold x_(n)≠0.

The key generation device 100 will be described.

The process of the Setup algorithm will be described with reference to FIG. 18.

The processes of S401 to S402 are the same as the processes of S301 to 5302 shown in FIG. 14.

(S403: Basis B Generation Step)

With a processing device, a basis generation part 113 generates bases D_(0,0), D_(0,j), D_(i,0,L), D_(i,j), and D′_(i,j,L), as indicated by Formula 180, in the same manner as the bases B_(0,0), B_(0,j), B_(i,0,j), and B′_(i,j,L) of Embodiment 4 are. for i, j=1, . . . , 4; L=−1, . . . ,n D _(0,0):=χ_(0,0) g, D _(0,j):=χ_(0,j) g, D _(i,0,L):=χi,0,Lg, D _(i,j):=μ_(i,j) g, D _(i,j,L)′:=μ′i,j,L′g  [Formula 180]

With the processing device, the basis generation part 113 also generates a basis

D* as indicated by Formula 181, in the same manner as the basis B* of Embodiment 4 is. (θ_(i,j))_(i,j=0, . . . , 4n):=ψ·(X ^(T))⁻¹, b _(i)*:=(θ_(i,1), . . . , θ_(i,N)

=Σ_(j=0) ^(4n)θ_(i,j)α_(j) for i=1, . . . , 4n,

* :=(b ₀ *, . . . , b _(4n)*)  [Formula 181]

Then, the basis generation part 113 treats the basis D* as a basis B. Also, for each of integers i, j of i, j=1, . . . , 4 and each integer L of L=1, . . . , n, the basis generation part 113 treats the variable D_(0.0) as a variable B*_(0,0), the variable D_(0,j) as a variable B*_(0,j), the variable D_(i,0,L) as a variable B*_(i,0,L), the variable D_(i,j) as a variable B*_(i,j), and the variable D′_(i,j,L) as a variable B′*_(i,j,L).

(S404: Basis BA Generation Step)

With the processing device, a key generation part 114 generates a basis B^, as indicated by Formula 182.

:=(b ₀ , . . . , b _(n) ,b _(3n+1) , . . . , b _(4n))  [Formula 182]

(S405: Master Key Generation Step)

With the processing device, the key generation part 114 sets public parameters pk:=(1^(λ), param_(n), B^), and master secret key sk:=({B*_(0,0), B*_(0,j), B*_(i,0,L), B*_(i,j)) B′*_(i,j,L)}_(i=1;3;j=1, . . . , 4;L=1, . . . n)). Then, the key generation part 114 stores the public parameters pk and the master secret key sk in a master key storage part 120.

Note param_(n):=(param_(v), g_(T)).

More specifically, from 5401 through S405, the key generation device 100 executes the Setup algorithm indicated by Formula 184 using algorithm G⁽⁴⁾ _(ob) indicated by Formula 183, to generate the public parameters pk and the master secret key sk. As indicated by Formula 183, the algorithm G⁽⁴⁾ _(ob), employs algorithm G⁽³⁾ _(ob) indicated by Formula 167.

$\begin{matrix} {{{{{??}_{ob}^{(4)}\left( {1^{\lambda},n} \right)}\text{:}\mspace{14mu}{\left( {{param}_{n},\left\{ {D_{0,0},D_{0,j},D_{i,0,L},D_{i,j},D_{i,j,L}^{\prime}} \right\}_{i,{j = 1},\ldots\mspace{14mu},{4;{L = 1}},\ldots\mspace{14mu},n},{??}^{*}} \right)\overset{R}{\longleftarrow}{{??}_{ob}^{(3)}\left( {1^{\lambda},n} \right)}}},{{??}:={??}^{*}},{B_{0,0}^{*}:=D_{0,0}},{B_{0,j}^{*}:=D_{0,j}},{B_{i,0,L}^{*}:=D_{i,0,L}},{B_{i,j}^{*}:=D_{i,j}},{B_{i,j}^{\prime*}:=D_{i,j}},{B_{i,j,L}^{\prime*}:=D_{i,j,L}^{\prime*}}}\mspace{20mu}{{{for}\mspace{14mu} i},{j = 1},{{\ldots\mspace{14mu} 4};{L = 1}},\ldots\mspace{14mu},n,{{return}\mspace{14mu}{\left( {{param}_{n},{??},\left\{ {B_{0,0}^{*},B_{0,j}^{*},B_{i,0,L}^{*},B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{i,{j = 1},\ldots\mspace{14mu},{4;{L = 1}},\ldots\mspace{14mu},n}} \right).}}}} & \left\lbrack {{Formula}\mspace{14mu} 183} \right\rbrack \\ {\left. {{{{Setup}\left( {1^{\lambda},n} \right)}\text{:}\mspace{14mu}{\begin{pmatrix} {{param}_{n},{??},} \\ \left\{ {B_{0,0}^{*},B_{0,j}^{*},B_{i,0,L}^{*},B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{i,{j = 1},\ldots\mspace{14mu},{4;{L = 1}},\ldots\mspace{14mu},n} \end{pmatrix}\overset{R}{\longleftarrow}{{??}_{ob}^{(4)}\left( {1^{\lambda},n} \right)}}},\mspace{20mu}{\hat{??}:=\left( {b_{0},\ldots\mspace{14mu},b_{n},b_{{3\; n} + 1},\ldots\mspace{14mu},b_{4\; n}} \right)},\mspace{20mu}{{{return}\mspace{14mu}{pk}}:=\left( {1^{\lambda},{param}_{n},\hat{??}} \right)},{{sk}:=\left\{ {B_{0,0}^{*},B_{0,j}^{*},B_{i,0,L}^{*},B_{i,j}^{*},B_{i,j,L}^{\prime*}} \right\}_{{i = 1},{3;{j = 1}},\ldots\mspace{14mu},{4;{L = 1}},\ldots\mspace{14mu},n}}} \right).} & \left\lbrack {{Formula}\mspace{14mu} 184} \right\rbrack \end{matrix}$

Note that the public parameters are publicized via, e.g., a network, so the encryption device 200 and decryption device 300 can acquire them.

The process of the KeyGen algorithm will be described with reference to FIG. 19.

The processes of S411 to S412 are the same as the processes of S311 to S312 shown in FIG. 15.

(S413: Element K* Generation Step)

With the processing device, a key element generation part 142 generates elements K*₀, K*_(1,j), and K*_(2,j), which are elements of a decryption key sk_(v→), as indicated by Formula 185. K ₀ *:=B _(0,0)*+Σ_(L=1) ^(n) v _(L)(δB _(1,0,L) *+φB _(3,0,L)*), for j=1, . . . , 4 K _(1,j) *=δB _(1,j) *+φB _(3,j)*, K _(2,j) *:=B _(0,j)*+Σ_(L=1) ^(n) v _(L)(δB _(1,j,L)′*+φB_(3,j,L)′*)  [Formula 185]

(S414: Key Distribution Step)

For example, with a communication device, a key distribution part 150 distributes the decryption key sk_(v→), constituted by as elements: the vector v^(→)inputted in S411 and the elements K*₀, K*_(1j), and K*_(2j) generated in S413, to the decryption device 300 in secrecy via the network. As a matter of course, the decryption key sk_(v→), might as well be distributed to the decryption device 300 by another method.

More specifically, from S411 through S413, the key generation device 100 executes the KeyGen algorithm indicated by Formula 186, to generate the decryption key sk_(v→). Then, in S414, the key generation device 100 distributes the generated decryption key sk_(v→) to the decryption device 300.

$\begin{matrix} {{{{{KeyGen}\left( {{pk},{sk},\overset{\rightarrow}{v}} \right)}\text{:}\mspace{14mu}\delta},{\varphi\overset{U}{\longleftarrow}{??}_{q}},{K_{0}^{*}:={B_{0,0}^{*} + {\sum\limits_{L = 1}^{n}\;{v_{L}\left( {{\delta\; B_{1,0,L}^{*}} + {\varphi\; B_{3,0,L}^{*}}} \right)}}}},{K_{1,j}^{*}:={{\delta\; B_{1,j}^{*}} + {\varphi\; B_{3,j}^{*}}}},{K_{2,j}^{*}:={B_{0,j}^{*} + {\sum\limits_{L = 1}^{n}\;{v_{L}\left( {{\delta\; B_{1,j,L}^{\prime*}} + {\varphi\; B_{3,j,L}^{\prime*}}} \right)}}}}}{{{{for}\mspace{14mu} j} = 1},\ldots\mspace{14mu},4}{{{return}\mspace{14mu}{sk}_{\overset{\rightarrow}{v}}}:={\left( {\overset{\rightarrow}{v},K_{0}^{*},\left\{ {K_{1,j}^{*},K_{2,j}^{*}} \right\}_{{j = 1},\ldots\mspace{14mu},4}} \right).}}} & \left\lbrack {{Formula}\mspace{14mu} 186} \right\rbrack \end{matrix}$

The encryption device 200 will be described.

The process of the Enc algorithm will be described with reference to. FIG. 20.

The processes of S421 to S423 are the same as the processes of S321 to S323 shown in FIG. 16.

(S424: Element c Generation Step)

With the processing device, a cipher element generation part 232 generates element c, which is an element of a ciphertext ct_(x→), as indicated by Formula 187.

$\begin{matrix} {c:={\left( {\zeta,\overset{\overset{n}{︷}}{\omega\;\overset{\rightarrow}{x}},\overset{\overset{n}{︷}}{0^{n}\;},\overset{\overset{n}{︷}}{0^{n}\;},\overset{\overset{n}{︷}}{\eta\;\overset{\rightarrow}{x}}} \right){??}}} & \left\lbrack {{Formula}\mspace{14mu} 187} \right\rbrack \end{matrix}$

As with Formula 135, Formula 187 means that: ζ is set as the coefficient for a basis vector b₀ of the basis B; ω_(x1), . . . , ω_(xn) are each set as the coefficient for basis vectors b₁, . . . , b_(n); 0 is set as the coefficient for basis vectors b_(n+1), . . . , b_(3n); and ηx₁, . . . , ηx_(n) are each set as the coefficient for basis vectors b₃₊₁, . . . , b_(4n).

The process of S425 is the same as the process of S325 shown in FIG. 16.

(S426: Data Transmission Step)

For example, with the communication device, a data transmission part 240 transmits the ciphertext ct_(x→), constituted by as elements: the vector x^(→) inputted in S422; the element c generated in S424; and an element c₃ generated in S425, to the decryption device 300 via the network. As a matter of course, the ciphertext ct_(x→) might as well be transmitted to the decryption device 300 by another method.

More specifically, from S421 through S425, the encryption device 200 executes the Enc algorithm indicated by Formula 188, to generate the ciphertext ct_(x→). In S426, the encryption device 200 transmits the generated ciphertext ct, to the decryption device 300.

$\begin{matrix} {{{{Enc}\left( {{pk},m,\overset{\rightarrow}{x}} \right)}\text{:}\mspace{14mu}\omega},\eta,{\zeta\overset{U}{\longleftarrow}{??}_{q}},{c:={\left( {\zeta,\overset{\overset{n}{︷}}{\omega\;\overset{\rightarrow}{x}},\overset{\overset{n}{︷}}{0^{n}\;},\overset{\overset{n}{︷}}{0^{n}\;},\overset{\overset{n}{︷}}{\eta\;\overset{\rightarrow}{x}}} \right){??}}},{c_{3}:={g_{T}^{\zeta}m}},{{{return}\mspace{14mu}{ct}_{\overset{\rightarrow}{x}}}:={\left( {\overset{\rightarrow}{x},c,c_{3}} \right).}}} & \left\lbrack {{Formula}\mspace{14mu} 188} \right\rbrack \end{matrix}$

The decryption device 300 will be described.

The process of the Dec algorithm will be described with reference to FIG. 21.

The processes of S431 to S432 are the same as the processes of S331 to S332 shown in FIG. 17.

(S433: Value D_(i) Calculation Step)

With the processing device, a pairing operation part 330 calculates value D_(j), as indicated by Formula 189. for j=:1, . . . , 4 D _(j):=Σ_(L=1) ^(n−1) v _(L) C _((j−1)n+L)  [Formula 189]

Note that the element c is parsed as (4n+1)-tuples (C*₀, . . . , C*_(4n))ε G^(4n+1).

(S434: Pairing Operation Step)

With the processing device, the pairing operation part 330 executes a pairing operation, as indicated by Formula 190, to calculate value F. F:=e(C ₀ ,K ₀*)·Π_(j=1) ⁴(e(D _(j) ,K _(1,j)*)·e(C _(jn) ,K _(2,j)*))  [Formula 190]

The process of S435 is the same as the process of S335 shown in FIG. 17.

More specifically, from S431 through S435, the decryption device 300 executes the Dec algorithm indicated by Formula 191, to calculate a message m′. Dec(pk,sk _({right arrow over (v)}):=({right arrow over (v)},K ₀ *,{K _(1,j) *, K _(2,j)*}_(j=1, . . . , 4)), ct _({right arrow over (x)}):=({right arrow over (x)},c,c ₃)): Parse c as a (4n+1)-tuple (C ₀ , . . . ,C _(4n))ε

4n+1, D _(j)*:=Σ_(L=1) ^(n−1) v _(L) C _((j−1)n+L) for j=1, . . . , 4 F:=e(C ₀ ,K ₀*)·Π_(j=1) ⁴(e(D _(j) ,K _(1,j)*)·e(C _(jn) ,K _(2,j)*)), return m′:=c ₃ /F.  [Formula 191]

Note that B*:=(b*₀, b*_(4n)) is specified by {B*_(0,0), B*_(0,j), B*_(i,0,L), B*_(i,j), B′*_(i,j,L)}_(i,j=1;4;L=1, . . . n). Also, {B*_(0,0), B*_(0,j), B*_(i,0,L), B*_(i,j), B′*_(i,j,L)}_(i=1;3;j=1, . . . , 4;L=1, . . . n) included in an output of the Setup algorithm is specified by B^*:=(b*₀, b*_(n), b*_(2n+1), . . . , b*_(3n)).

The Dec algorithm can be described as Dec′ algorithm indicated by Formula 192.

$\begin{matrix} {{{{{Dec}^{\prime}\left( {{pk},{{sk}_{\overset{\rightarrow}{v}}:=\left( {\overset{\rightarrow}{v},K_{0}^{*},\left\{ {K_{1,j}^{*},K_{2,j}^{*}} \right\}_{{j = 1},\ldots\mspace{14mu},4}} \right)},{{ct}_{\overset{\rightarrow}{x}}:=\left( {\overset{\rightarrow}{x},c,c_{3}} \right)}} \right)}:k^{*}}:=\left( {K_{0}^{*},\overset{\overset{n}{︷}}{{v_{1}K_{1,1}^{*}},\ldots\mspace{14mu},{v_{n - 1}K_{1,1}^{*}},K_{2,1}^{*}},\ldots\mspace{14mu},\overset{\overset{n}{︷}}{{v_{1}K_{1,4}^{*}},\ldots\mspace{14mu},{v_{n - 1}K_{1,4}^{*}},K_{2,4}^{*}}} \right)},\mspace{79mu}{{that}\mspace{14mu}{is}},{k^{*} = {\left( {1,\overset{\overset{n}{︷}}{\delta\;\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}},\overset{\overset{n}{︷}}{\varphi\overset{\rightarrow}{v}},\overset{\overset{n}{︷}}{0^{n}\;}} \right){??}^{*}}},\mspace{79mu}{F:={e\left( {c,k^{*}} \right)}},\mspace{79mu}{{{return}\mspace{14mu} m^{\prime}}:={c_{3}/{F.}}}} & \left\lbrack {{Formula}\mspace{14mu} 192} \right\rbrack \end{matrix}$

In the zero inner-product encryption scheme explained in Embodiment 5, the decryption key sk_(v→) includes a total of 9 elements of G, namely, 1 by element K*₀ and 8 by elements K*_(1,j) and K*_(2,j) for each integer j of j=1, . . . , 4 indicated by Formula 185. In fine, the decryption key sk_(v→) has a constant size in n.

Also, in the zero inner-product encryption scheme explained in Embodiment 5, the decryption process (Dec algorithm) executes a total of only 9 pairing operations, namely, 1 by e(C₀, K*₀) and 8 by Π_(j=1) ⁴(e(D_(j), K*_(1,j))·e(C_(jn), K*_(2,j))) indicated by Formula 190. In fine, the decryption process requires only a small number of pairing operations.

The above embodiments employ the linear transformation X shown in (b) of FIG. 2. However, linear transformation X is not limited to that shown in (b) of FIG. 2. For example, in (b) of FIG. 2, the hatched squares may have values different from each other. In (b) of FIG. 2, all components in an N column have random values other than constant value 0. However, alternatively, in place of the N column, all components in at least one of other columns might as well have random values other than constant value 0.

More generally, linear transformation X suffices if it is a sparse matrix in which each row and each column have at least one value that is other than constant value 0. Furthermore, in case of an n-row, n-column matrix, linear transformation X preferably has at least n of different value g as values other than constant value 0. Furthermore, linear transformation X is preferably such that all components in at least one column have values other than constant value 0. Furthermore, linear transformation X is preferably such that its diagonal components and all components in at least one column have values other than constant value 0. Furthermore, linear transformation X is preferably such that its diagonal components have the same value except for columns in which all components have values other than constant value 0.

Even with such a linear transformation X, the sizes of the public parameters and secret key are smaller than in a case where conventional linear transformation X is used. Also, the time taken for the generation process of the user key and the encryption process is shortened.

Depending on the type of linear transformation X, the number of pairing operations cannot be decreased.

In the above embodiments, the vector space consists of four orthogonal subspaces, that is, encoding part, hidden part, secret-key randomness part, and ciphertext randomness part. In order to cope with this, the linear transformation X is constituted using an n-row, n-column matrix X_(i,j) (i, j=1, . . . , 4), as indicated by Formula 124. This structure of the linear transformation X rests on a premise that the subspaces of the hidden part, secret-key randomness part, and ciphertext randomness part are n-dimensional, as with the subspace of the encoding part.

Alternatively, the subspaces of the hidden part, secret-key randomness part, and ciphertext randomness part need not be n-dimensional unlike the subspace of the encoding part. For example, the subspace of the hidden part may be (n×u)-dimensional, the subspace of the secret-key randomness part may be (n×w)-dimensional, and the subspace of the ciphertext randomness part may be (n×z)-dimensional (u, w, and z are each an integer of 0 or more). In this case, the linear transform X may be constituted using an n-row, n-column matrix X_(i,j) (i, j=1, . . . , 1+u+w+z), as indicated by Formula 193.

$\begin{matrix} {X:=\begin{pmatrix} X_{1,1} & \ldots & X_{1,{1 + u + w + z}} \\ \vdots & \; & \vdots \\ X_{{1 + u + w + z},1} & \ldots & X_{{1 + u + w + z},{1 + u + w + z}} \end{pmatrix}} & \left\lbrack {{Formula}\mspace{14mu} 193} \right\rbrack \end{matrix}$

ID (Identity)-based revocation (IBR) and ID (Identity)-based broadcast encryption (IBBE) constitute a class of functional encryption (see Non-Patent Literatures 1, 5, 6, 8, 19, and 12).

According to the ID-based revocation, a ciphertext is encrypted for a set of identities S=(ID₁, . . . , ID_(n)). The ciphertext is decrypted by a secret key associated with ID that does not satisfy IDε S. More specifically, decryption requires R^(IBR)(ID, S)=1 if and only if IDε S is not established.

According to the ID-based broadcast encryption, a ciphertext is encrypted for a set of identities S=(ID₁, . . . , ID_(n)). The ciphertext is decrypted by a secret key associated with ID that satisfies IDε S. More specifically, decryption requires R^(IBBE)(ID, S)=1 if and only if IDε S is established.

Assume S(X)=Σ_(i=0) ^(n)v_(i)X^(i):=Π_(i=1) ^(n)(X−ID_(i)) where S:={ID₁, . . . , ID_(n)}. Also, assume a vector v^(→):=(v₀, v₁, . . . , v_(n)) and a vector x^(→):=(1, ID, . . . , ID^(n)).

Then, the non-zero inner-product encryption scheme explained in Embodiments 2 and 3 can be regarded as an ID-based revocation scheme, and the zero inner-product encryption scheme explained in Embodiments 4 and 5 can be regarded as an ID-based broadcast encryption scheme.

More specifically, the inner-product encryption schemes explained in the above embodiments can implement an ID-based revocation scheme and an ID-based broadcast encryption scheme. In this case as well, a ciphertext or a decryption key can have a constant size in n, so that decryption can be conducted by a small number of pairing operations.

In addition to the practical encryption schemes explained in Embodiments 2 to 5, if the linear transformation X described above is applied to the encryption schemes explained in Non-Patent Literatures 13, 15, 16, 17, and the like, the sizes of the public parameters and secret key decrease. Also, the time taken for the generation process of the user key and the encryption process is shortened.

FIG. 22 shows comparison of the non-zero inner-product encryption schemes and zero inner-product encryption schemes explained in Embodiments 2 to 5 with the non-zero inner-product encryption scheme and the zero inner-product encryption scheme described in Non-Patent Literature 2.

In FIG. 22, |G|, |G_(T)|, |F_(q)|, P, and M represent size of G, size of G_(T), size of F_(q), pairing operation, and scalar multiplication on G, respectively, Also, CT, SK, IP, and DBDH stand for ciphertext, secret key (decryption key), inner product, and decisional bilinear Diffie-Hellman, respectively.

Embodiment 6

In the above embodiments, the method of implementing the cryptographic process in the dual vector spaces has been described. In Embodiment 6, a method of implementing a cryptographic process in dual additive groups will be described.

More specifically, in the above embodiments, the cryptographic process is implemented in the cyclic group of the prime order q. When a ring R is expressed using a composite number M as indicated by Formula 194, the cryptographic process described in the above embodiments can also be applied to an additive group having a ring R as a coefficient.

:=

  [Formula 194] where

-   : an integer; and -   M: a composite number

If F_(q) in the algorithm explained in the above embodiments is changed to R, the cryptographic process in a dual additive group can be implemented.

The hardware configuration of a cryptographic processing system 10 (a key generation device 100, an encryption device 200, and a decryption device 300) in an embodiment will be described.

FIG. 23 is a diagram showing an example of the hardware configuration of each of the key generation device 100, the encryption device 200, the decryption device 300, and a key delegation device 400.

As shown in FIG. 23, each of the key generation device 100, encryption device 200, decryption device 300, and key delegation device 400 includes a CPU 911 (Central Processing Unit; also referred to as central processing device, processing device, computation device, microprocessor, microcomputer, or processor) which executes programs. The CPU 911 is connected to a ROM 913, a RAM 914, an LCD 901 (Liquid Crystal Display), a keyboard 902 (KB), a communication board 915, and a magnetic disk device 920 via a bus 912, and controls these hardware devices. In place of the magnetic disk device 920 (fixed disk device), a storage device such as an optical disk device or memory card readwrite device may be employed. The magnetic disk device 920 is connected via a predetermined fixed disk interface.

The ROM 913 and the magnetic disk device 920 are examples of a nonvolatile memory. The RAM 914 is an example of a volatile memory. The ROM 913, the RAM 914, and the magnetic disk device 920 are examples of the storage device (memory). The keyboard 902 and the communication board 915 are examples of an input device. The communication board 915 is an example of a communication device. Furthermore, the LCD 901 is an example of a display device.

The magnetic disk device 920, ROM 913, or the like stores an operating system 921 (OS), a window system 922, programs 923, and files 924. The CPU 911, the operating system 921, and the window system 922 execute each program of the programs 923.

The programs 923 store software and programs that execute the functions described as the “master key generation part 110”, “master key storage part 120”, “information input part 130”, “decryption key generation part 140”, “key distribution part 150”, “public parameter acquisition part 210”, “information input part 220”, “ciphertext generation part 230”, “data transmission part 240”, “decryption key acquisition part 310”, “data reception part 320”, “pairing operation part 330”, “message calculation part 340”, and the like in the above description. The programs 923 store other programs as well. The programs are read and executed by the CPU 911.

The files 924 store information, data, signal values, variable values, and parameters such as the “public parameters pk”, “master secret key sk”, “decryption key sk_(v→)”* , “ciphertext ct_(x→)”, and the like of the above explanation, as the items of a “file” and “database”. The “file” and “database” are stored in a recording medium such as a disk or memory. The information, data, signal values, variable values, and parameters stored in the recording medium such as the disk or memory are read out to the main memory or cache memory by the CPU 911 through a readwrite circuit, and are used for the operations of the CPU 911 such as extraction, search, look-up, comparison, computation, calculation, process, output, print, and display. The information, data, signal values, variable values, and parameters are temporarily stored in the main memory, cache memory, or buffer memory during the operations of the CPU 911 including extraction, search, look-up, comparison, computation, calculation, process, output, print, and display.

The arrows of the flowcharts in the above explanation mainly indicate inputoutput of data and signals. The data and signal values are recorded in the memory of the RAM 914, the recording medium such as an optical disk, or in an IC chip. The data and signals are transmitted online via a transmission medium such as the bus 912, signal lines, or cables; or electric waves.

The “part” in the above explanation may be a “circuit”, “device”, “equipment”, “means” or “function”; or a “step”, “procedure”, or “process”. The “device” may be a “circuit”, “equipment”, “means”, or “function”; or a “step”, “procedure”, or “process”. The “process” may be a “step”. Namely, the “part” may be implemented as firmware stored in the ROM 913. Alternatively, the “part” may be implemented by only software; by only hardware such as an element, a device, a substrate, or a wiring line; by a combination of software and hardware; or furthermore by a combination of software, hardware, and firmware. The firmware and software are stored, as a program, in the recording medium such as the ROM 913. The program is read by the CPU 911 and executed by the CPU 911. Namely, the program causes the computer or the like to function as a “part” described above. Alternatively, the program causes the computer or the like to execute the procedure and method of the “part” described above.

REFERENCE SIGNS LIST

10: cryptographic processing system; 100: key generation device; 110: master key generation part; 111: space generation part; 112: matrix generation part; 113: basis generation part; 114: key generation part; 120: master key storage part; 130: information input part; 140: decryption key generation part; 141: random number generation part; 142: key element generation part; key distribution part; 200: encryption device; 210: public parameter acquisition part; 220: information input part; 230: ciphertext generation part; 231: random number generation part; 232: cipher element generation part; 240: data transmission part; 300: decryption device; 310: decryption key acquisition part; 320: data reception part; 330: pairing operation part; 340: message calculation part 

The invention claimed is:
 1. A cryptographic processing system configured to utilize a basis B and a basis B* generated by transforming a predetermined basis A using a sparse matrix in which each row and each column have at least one value that is other than constant value 0, to conduct a cryptographic process, the cryptographic processing system comprising: encryption circuitry that generates a vector in the basis B, the vector being embedded with predetermined information, as a cipher vector; and decryption circuitry that, by treating a predetermined vector in the basis B* as a key vector, conducts a pairing operation for the key vector and the cipher vector which is generated by the encryption circuitry, so as to decrypt the cipher vector, and extracts information on the predetermined information.
 2. The cryptographic processing system according to claim 1, wherein the sparse matrix is an n-row, n-column (n is an integer of 2 or more) matrix, and has at least n of different values as a value other than constant value
 0. 3. The cryptographic processing system according to claim 2, wherein the sparse matrix is such that all components in at least one column have values other than constant value
 0. 4. The cryptographic processing system according to claim 3, wherein the sparse matrix is such that diagonal components thereof and all components in at least one column have values other than constant value
 0. 5. The cryptographic processing system according to claim 4, wherein the sparse matrix is such that the diagonal components have the same value except for the column in which all components have values other than constant value
 0. 6. The cryptographic processing system according to claim 5, wherein the sparse matrix is a matrix indicated by Formula 1: $\begin{matrix} \begin{pmatrix} \mu & \; & \; & \mu_{1}^{\prime} \\ \; & \ddots & \; & \vdots \\ \; & \; & \mu & \mu_{n - 1}^{\prime} \\ \; & \; & \; & \mu_{n}^{\prime} \end{pmatrix} & \left\lbrack {{Formula}\mspace{14mu} 1} \right\rbrack \end{matrix}$ where μ, μ′1, . . . , μ′n are each a predetermined value other than constant value 0, and blank portions represent constant value
 0. 7. The cryptographic processing system according to claim 1, wherein a basis B and a basis B* are used, the basis B and the basis B* being generated from the basis A as indicated by Formula 3 using an N-row, N-column (N is an integer of n or more) linear transformation X constituting a sparse matrix in which a 1st row, 1st column value to an n-th row, n-th column value are as indicated by Formula 2, wherein the encryption circuitry generates a vector including Formula 4, as the cipher vector, and wherein the decryption circuitry, by treating a vector k* including Formula 5, as the key vector, decrypts the cipher vector: $\begin{matrix} \begin{pmatrix} \mu_{1} & \; & \; & \mu_{1}^{\prime} \\ \; & \ddots & \; & \vdots \\ \; & \; & \mu_{n - 1} & \mu_{n - 1}^{\prime} \\ \; & \; & \; & \mu_{n}^{\prime} \end{pmatrix} & \left\lbrack {{Formula}\mspace{14mu} 2} \right\rbrack \end{matrix}$ where μ₁, . . . , μ_(n−1), μ′₁, . . . , μ′_(n) are each a predetermined value other than constant value 0, and blank portions represent constant value 0, b _(i):=Σ_(j=1) ^(N)χ_(i,j)α_(j) for i=1, . . . , N, B:=(b ₁ , . . . , b _(N)) θ_(i,j):=ψ·(X ^(T))⁻¹, b _(i)*:=Σ_(j=1) ^(N)θ_(i,j)α_(j) for i=1, . . . , N, B*:=(b* ₁, . . . , b* _(N))   [Formula 3] where χ_(i,j) is an i-th row, j-th column component of the linear transformation X, ψ is a predetermined value, and a_(j) is a j-th basis vector of the basis A, Σ_(i=1) ^(n ωχ) _(i) b _(i)  [Formula 4] where ω and x₁, . . . , x_(n) are each a predetermined value, and Σ_(i=1) ^(n) δv _(i) b _(i)*  [Formula 5] where δ and v₁, . . . , v_(n) are each a predetermined value.
 8. The cryptographic processing system according to claim 7, wherein the sparse matrix indicated by Formula 2 has values B_(i) (i=1, . . . , n−1) which are the same value B, wherein the encryption circuitry generates a vector including a vector C₁ and a vector C₂, as the cipher vector, the vector C₁ including Formula 6, the vector C₂ including Formula 7, and wherein the encryption circuitry calculates D* indicated by Formula 8, to conduct pairing operation indicated by Formula 9: C ₁ :=ωB ₁  [Formula 6] C ₂:=Σ_(i=1) ^(n) x _(i) (ωB _(i)′)  [Formula 7] D*:=Σ _(i=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ x _(i))K _(i)*  [Formula 8] where K*₁, . . . , K*_(n−1) are each a component of basis vectors b*₁, . . . , b*_(n−1) for a case where the vector k* is decomposed into components for respective basis vectors, e(C ₁ ,D*)·e(C ₂ ,K _(n)*)  [Formula 9] where K*_(n) is a component of a basis vector b*_(n) for a case where the vector k* is decomposed into components for respective basis vectors.
 9. The cryptographic processing system according to claim 7, wherein the sparse matrix indicated by Formula 2 has values B_(i) , (i=1, . . . , n−1) which are the same value B, wherein the encryption circuitry generates a vector including a vector C₁ and a vector C₂, as the cipher vector, the vector C₁ including Formula 10, the vector C₂ including Formula 11, and wherein the encryption circuitry calculates D* indicated by Formula 12, to conduct pairing operation indicated by Formula 13: C ₁ :=ωB ₁  [Formula 10] C ₂:=Σ_(i=1) ^(n) x _(i)(ωB _(i)′)  [Formula 11] D*:=Σ _(i=1) ^(n−1) x _(i) K _(i)*  [Formula 12] where K*₁, . . . , K*_(n−1) are each a component of basis vectors b*₁, . . . , b*_(n−1) for a case where the vector k* is decomposed into components for respective basis vectors, and e(C ₁ ,D*)·e(C ₂ ,K _(n)*)  [Formula 13] where K*_(n) is a component of a basis vector b*_(n) for a case where the vector k* is decomposed into components for respective basis vectors.
 10. The cryptographic processing system according to claim 1, wherein a basis B and a Basis B* are utilized, the basis B and the basis B* being generated from the basis A as indicated by Formula 15 using an N-row, N-column (N is an integer of n or more) linear transformation X constituting a sparse matrix in which a 1st row, 1st column value to an n-th row, n-th column value are as indicated by Formula 14, wherein the encryption circuitry generates a vector c including Formula 16, as the cipher vector, and wherein the decryption circuitry by treating a vector including Formula 17, as the key vector, decrypts the cipher vector: $\begin{matrix} \begin{pmatrix} \mu_{1} & \; & \; & \mu_{1}^{\prime} \\ \; & \ddots & \; & \vdots \\ \; & \; & \mu_{n - 1} & \mu_{n - 1}^{\prime} \\ \; & \; & \; & \mu_{n}^{\prime} \end{pmatrix} & \left\lbrack {{Formula}\mspace{14mu} 14} \right\rbrack \end{matrix}$ where μ₁, . . . , μ_(n−1), μ′₁, . . . , μ′_(n) are each a predetermined value other than constant value 0, and blank portions represent constant value 0, b _(i)*:=Σ_(j=1) ^(N)χ_(i,j)α_(j) for i=1, . . . , N, B*:=(b* ₁, . . . , b* _(N)) θ_(i,j):=ψ·(X ^(T))⁻¹, b _(i):=Σ_(j=1) ^(N)θ_(i,j)α_(j) for i=1, . . . , N, B:=(b ₁, . . . , b _(N))   [Formula 15] where χ_(i,j) is an i-th row, j-th column component of the linear transformation X, ψ is a predetermined value, and a_(j) is a j-th basis vector of the basis A, Σ_(i=1) ^(n) ωx _(i) b _(i)  [Formula 16] where ω and x₁, . . . , x_(n) are each a predetermined value, and Σ_(i=1) ^(n) δv _(i) b _(i)*  [Formula 17] where δ and v₁, . . . , v_(n) are each a predetermined value.
 11. The cryptographic processing system according to claim 10, wherein the sparse matrix indicated by Formula 14 has values B_(i) , (i=1, . . . , n−1) which are the same value B, and wherein the decryption circuitry, by treating a vector including a vector K*₁ and a vector K*₂, as the key vector, the vector K*₁ including Formula 18, the vector K^(*) ₂ including Formula 19, calculates D* indicated by Formula 20, to conduct pairing operation indicated by Formula 21: K ₁ *:=δB ₁  [Formula 18] K ₂*:=Σ_(i=1) ^(n) v _(i)(δB _(i)′)  [Formula 19] D:=Σ _(i=1) ^(n−1)(({right arrow over (x)}·{right arrow over (v)})⁻¹ v _(i))C _(i)  [Formula 20] where C₁, . . . , C_(n−1) are each a component of basis vectors b₁, . . . , b_(n−1) for a case where the vector c is decomposed into components for respective basis vectors, and e(D,K ₁*)·e(C _(n) ,K ₂*)  [Formula 21] where C_(n) is a component of a basis vector b_(n) for a case where the vector c is decomposed into components for respective basis vectors.
 12. The cryptographic processing system according to claim 10, wherein the sparse matrix indicated by Formula 14 has values B , (i=1, . . . , n−1) which are the same value B, and wherein the decryption circuitry, by treating a vector including a vector K*₁ and a vector K*₂, as the key vector, the vector K*₁ including Formula 22, the vector K^(*) ₂ including Formula 23, calculates D* indicated by Formula 24, to conduct pairing operation indicated by Formula 25: K ₁ *:=δB ₁  [Formula 22] K ₂*:=Σ_(i=1) ^(n) v _(i)(δB _(i)′)  [Formula 23] D:=Σ _(i=1) ^(n−1) v _(i) C _(i)  [Formula 24] where C₁, . . . , C_(n−1) are each a component of basis vectors b₁, . . . , b_(n−1) for a case where the vector c is decomposed into components for respective basis vectors, and e(D,K ₁*)·e(C _(n) ,K ₂*)  [Formula 25] where C_(n) is a component of the basis vector b. for a case where the vector c is decomposed into components for respective basis vectors.
 13. A cryptographic processing method configured to utilize a basis B and a basis B* generated by transforming a predetermined basis A using a sparse matrix in which each row and each column have at least one value other than 0, to conduct a cryptographic process, the cryptographic processing method comprising: with an encryption device, generating a vector in the basis B, the vector being embedded with predetermined information, as a cipher vector; and with a decryption device, by treating a predetermined vector in the basis B* as a key vector, conducting a pairing operation for the key vector and the cipher vector which is generated by the encryption device, so as to decrypt the cipher vector, and extracting information on the predetermined information.
 14. A non-transitory computer-readable medium encoded with computer-readable instructions that, when executed by a computer, cause the computer to utilize a basis B and a basis B* generated by transforming a predetermined basis A using a sparse matrix in which each row and each column have at least one value other than 0, to perform a method, comprising: generating a vector in the basis B, the vector being embedded with predetermined information, as a cipher vector; and by treating a predetermined vector in the basis B* as a key vector, conducting a pairing operation for the key vector and the cipher vector so as to decrypt the cipher vector, and extracting information on the predetermined information.
 15. A key generation device for generating a public parameter and a secret key in public key encryption, comprising: a matrix generation circuit which generates a linear transformation X including a sparse matrix in which each row and each column have at least one value other than 0; a basis generation circuit which generates a basis D and a basis D* from a predetermined basis A as indicated by Formula 26 using the linear transformation X generated by the matrix generation circuit; and a master key generation circuit which, by treating at least part of basis vectors of one of the basis D and the basis D* generated by the basis generation circuit, as a public parameter, generates at least part of basis vectors of a remaining one of the basis D and the basis D*, as a secret key: b _(i):=Σ_(j=1) ^(N)χ_(i,j)α_(j) for i=1, . . . , N, D:=(b ₁ , . . . , b _(N)) θ_(i,j):=ψ·(X ^(T))⁻¹, b _(i)*:=Σ_(j=1) ^(N)θ_(i,j)α_(j) for i=1, . . . , N, D*:=(b* ₁, . . . , b* _(N))   [Formula 26] where χ_(i,j) is an i-th row, j-th column component of the linear transformation X, ψ is a predetermined value, and a_(j) is a j-th basis vector of the basis A. 